Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness Qipeng LiuMark Zhandry OriginalPaper 06 July 2021 Article: 35
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer Sai Sheshank BurraEnrique LarraiaNigel P. Smart OriginalPaper 30 June 2021 Article: 34
Ascon v1.2: Lightweight Authenticated Encryption and Hashing Christoph DobraunigMaria EichlsederMartin Schläffer OriginalPaper Open access 22 June 2021 Article: 33
Translating the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves with \((\ell ,\ell ,\ell )\)-Isogenies Song Tian OriginalPaper 15 June 2021 Article: 32
On the Tight Security of TLS 1.3: Theoretically Sound Cryptographic Parameters for Real-World Deployments Denis DiemertTibor Jager OriginalPaper Open access 04 June 2021 Article: 30
Adaptively Secure Distributed PRFs from \(\textsf {LWE}\) Benoît LibertDamien StehléRadu Titiu OriginalPaper 02 June 2021 Article: 29
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions Sam KimDavid J. Wu OriginalPaper 26 May 2021 Article: 28
Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) versus QUIC Shan ChenSamuel JeroCristina Nita-Rotaru OriginalPaper Open access 24 May 2021 Article: 26
Simple and Generic Constructions of Succinct Functional Encryption Fuyuki KitagawaRyo NishimakiKeisuke Tanaka OriginalPaper 24 May 2021 Article: 25
Introduction to the Special Issue on TLS 1.3 Colin Boyd OriginalPaper Open access 24 May 2021 Article: 24
Fine-Grained Cryptography Revisited Shohei EgashiraYuyu WangKeisuke Tanaka OriginalPaper 24 May 2021 Article: 23
Modeling for Three-Subset Division Property without Unknown Subset Yonglin HaoGregor LeanderQingju Wang OriginalPaper 20 May 2021 Article: 22
A Formal Analysis of Prefetching in Profiled Cache-Timing Attacks on Block Ciphers Chester RebeiroDebdeep Mukhopadhyay OriginalPaper 20 May 2021 Article: 21
Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT Nimrod AviramKai GellertTibor Jager OriginalPaper Open access 18 May 2021 Article: 20
Round-Optimal Secure Multi-party Computation Shai HaleviCarmit HazayMuthuramakrishnan Venkitasubramaniam OriginalPaper 13 May 2021 Article: 19
Is There an Oblivious RAM Lower Bound for Online Reads? Mor WeissDaniel Wichs OriginalPaper 11 May 2021 Article: 18
On Subversion-Resistant SNARKs Behzad AbdolmalekiHelger LipmaaMichał Zając OriginalPaper 28 April 2021 Article: 17
Match Me if You Can: Matchmaking Encryption and Its Applications Giuseppe AtenieseDanilo FrancatiDaniele Venturi OriginalPaper 21 April 2021 Article: 16