default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Cryptology, Volume 32
Volume 32, Number 1, January 2019
- Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg
:
Multidimensional Linear Cryptanalysis. 1-34 - Shi Bai, Steven D. Galbraith, Liangze Li, Daniel Sheffield:
Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem. 35-83 - Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
On the Tightness of Forward-Secure Signature Reductions. 84-150 - Alexandre Duc, Stefan Dziembowski, Sebastian Faust:
Unifying Leakage Models: From Probing Attacks to Noisy Leakage. 151-177 - Susumu Kiyoshima:
Round-Efficient Black-Box Construction of Composable Multi-Party Computation. 178-238 - Masayuki Abe, Jan Camenisch, Rafael Dowsley, Maria Dubovitskaya:
On the Impossibility of Structure-Preserving Deterministic Primitives. 239-264
Volume 32, Number 2, April 2019
- Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft, Angelo Agatino Nicolosi:
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. 265-323 - Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
Automated Analysis of Cryptographic Assumptions in Generic Group Models. 324-360 - Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. 361-392 - Susumu Kiyoshima:
Non-black-box Simulation in the Fully Concurrent Setting, Revisited. 393-434 - Florent Bernard, Patrick Haddad, Viktor Fischer, Jean Nicolai:
From Physical to Stochastic Modeling of a TERO-Based TRNG. 435-458 - Seung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou:
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens. 459-497 - Georg Fuchsbauer, Christian Hanser, Daniel Slamanig:
Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials. 498-546 - Jung Hee Cheon, Kyoohyung Han, Changmin Lee, Hansol Ryu, Damien Stehlé:
Cryptanalysis of the CLT13 Multilinear Map. 547-565 - Nils Fleischhacker, Tibor Jager, Dominique Schröder:
On Tight Security Proofs for Schnorr Signatures. 566-599
Volume 32, Number 3, July 2019
- Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Key Establishment à la Merkle in a Quantum World. 601-634 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On Black-Box Complexity of Universally Composable Security in the CRS Model. 635-689 - Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Probabilistic Termination and Composability of Cryptographic Protocols. 690-741 - Dana Dachman-Soled, S. Dov Gordon, Feng-Hao Liu, Adam O'Neill, Hong-Sheng Zhou:
Leakage Resilience from Program Obfuscation. 742-824 - Mark Zhandry:
The Magic of ELFs. 825-866 - Thomaz Oliveira, Julio López, Daniel Cervantes-Vázquez, Francisco Rodríguez-Henríquez:
Koblitz Curves over Quadratic Fields. 867-894 - Philipp Jovanovic, Atul Luykx, Bart Mennink, Yu Sasaki, Kan Yasuda:
Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes. 895-940 - Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. 941-972 - Masayuki Abe, Jens Groth, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi:
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments. 973-1025 - Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai:
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ. 1026-1069
Volume 32, Number 4, October 2019
- Felipe Gomes Lacerda, Joseph M. Renes, Renato Renner:
Classical Leakage Resilience from Fault-Tolerant Quantum Computation. 1071-1094 - Estuardo Alpirez Bock, Joppe W. Bos, Chris Brzuska, Charles Hubain, Wil Michiels, Cristofaro Mune, Eloi Sanfelix Gonzalez, Philippe Teuwen, Alexander Treff:
White-Box Cryptography: Don't Forget About Grey-Box Attacks. 1095-1143 - Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. 1144-1199 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
What Security Can We Achieve Within 4 Rounds? 1200-1262 - Alexandre Duc, Sebastian Faust, François-Xavier Standaert:
Making Masking Security Proofs Concrete (Or How to Evaluate the Security of Any Leaking Device), Extended Version. 1263-1297 - Razvan Barbulescu, Sylvain Duquesne:
Updating Key Size Estimations for Pairings. 1298-1336 - Atsushi Takayasu, Yao Lu, Liqiang Peng:
Small CRT-Exponent RSA Revisited. 1337-1382 - Yosuke Todo, Gregor Leander, Yu Sasaki:
Nonlinear Invariant Attack: Practical Attack on Full SCREAM, iSCREAM, and Midori64. 1383-1422 - Colin Chaigneau, Thomas Fuhr, Henri Gilbert, Jérémy Jean, Jean-René Reinhard:
Cryptanalysis of NORX v2.0. 1423-1447 - Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir:
Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications. 1448-1490 - Tatsuaki Okamoto, Katsuyuki Takashima:
Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption. 1491-1573
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 2024-10-31 20:18 CET 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:
