default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Cryptology, Volume 34
Volume 34, Number 1, January 2021
- Léo Ducas, Yang Yu
:
Learning Strikes Again: The Case of the DRS Signature Scheme. 1 - Ran Canetti, Benjamin Fuller, Omer Paneth, Leonid Reyzin, Adam D. Smith:
Reusable Fuzzy Extractors for Low-Entropy Distributions. 2 - Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki:
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE. 3 - Christian Kaspers, Yue Zhou:
The Number of Almost Perfect Nonlinear Functions Grows Exponentially. 4 - Shuichi Katsumata, Shota Yamada, Takashi Yamakawa:
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model. 5 - Mark Zhandry:
Quantum Lightning Never Strikes the Same State Twice. Or: Quantum Money from Cryptographic Assumptions. 6 - Shai Halevi, Victor Shoup:
Bootstrapping for HElib. 7 - Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? 8
Volume 34, Number 2, April 2021
- Gilad Asharov, Gil Segev, Ido Shahaf:
Tight Tradeoffs in Searchable Symmetric Encryption. 9 - Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin:
On the Local Leakage Resilience of Linear Secret Sharing Schemes. 10 - Benny Applebaum, Prashant Nalini Vasudevan:
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. 11 - Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. 12 - David Derler, Kai Gellert, Tibor Jager, Daniel Slamanig, Christoph Striecks:
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. 13 - Benny Applebaum, Zvika Brakerski:
Obfuscating Circuits Via Composite-Order Graded Encoding. 14
Volume 34, Number 3, July 2021
- Vincent Rijmen:
Editorial. 15 - Giuseppe Ateniese, Danilo Francati, David Nuñez, Daniele Venturi:
Match Me if You Can: Matchmaking Encryption and Its Applications. 16 - Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac:
On Subversion-Resistant SNARKs. 17 - Mor Weiss, Daniel Wichs:
Is There an Oblivious RAM Lower Bound for Online Reads? 18 - Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-party Computation. 19 - Nimrod Aviram, Kai Gellert, Tibor Jager:
Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT. 20 - Chester Rebeiro, Debdeep Mukhopadhyay:
A Formal Analysis of Prefetching in Profiled Cache-Timing Attacks on Block Ciphers. 21 - Yonglin Hao, Gregor Leander, Willi Meier, Yosuke Todo, Qingju Wang:
Modeling for Three-Subset Division Property without Unknown Subset. 22 - Shohei Egashira, Yuyu Wang, Keisuke Tanaka:
Fine-Grained Cryptography Revisited. 23 - Colin Boyd:
Introduction to the Special Issue on TLS 1.3. 24 - Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka:
Simple and Generic Constructions of Succinct Functional Encryption. 25 - Shan Chen, Samuel Jero, Matthew Jagielski, Alexandra Boldyreva, Cristina Nita-Rotaru:
Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) versus QUIC. 26 - Nir Drucker, Shay Gueron:
Selfie: reflections on TLS 1.3 with PSK. 27 - Sam Kim, David J. Wu:
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions. 28 - Benoît Libert, Damien Stehlé, Radu Titiu:
Adaptively Secure Distributed PRFs from sf LWE. 29 - Denis Diemert, Tibor Jager:
On the Tight Security of TLS 1.3: Theoretically Sound Cryptographic Parameters for Real-World Deployments. 30 - Jérémy Jean, Ivica Nikolic, Thomas Peyrin, Yannick Seurin:
The Deoxys AEAD Family. 31 - Christoph Dobraunig, Maria Eichlseder, Florian Mendel, Martin Schläffer:
Ascon v1.2: Lightweight Authenticated Encryption and Hashing. 33 - Song Tian:
Translating the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves with (ℓ , ℓ , ℓ )-Isogenies. 32 - Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart:
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. 34 - Qipeng Liu, Mark Zhandry:
Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. 35
Volume 34, Number 4, October 2021
- Ted Krovetz, Phillip Rogaway:
The Design and Evolution of OCB. 36 - Benjamin Dowling, Marc Fischlin, Felix Günther, Douglas Stebila:
A Cryptographic Analysis of the TLS 1.3 Handshake Protocol. 37 - Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. 38 - Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? 39 - Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. 40 - Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa:
Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings. 42 - Amir Jafari, Shahram Khazaei:
On Abelian and Homomorphic Secret Sharing Schemes. 43 - Yehuda Lindell:
Fast Secure Two-Party ECDSA Signing. 44 - Antonio Flórez-Gutiérrez, Gaëtan Leurent, María Naya-Plasencia, Léo Perrin, André Schrottenloher, Ferdinand Sibleyras:
Internal Symmetries and Linear Properties: Full-permutation Distinguishers and Improved Collisions on Gimli. 45
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-08 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
