default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Cryptology, Volume 28
Volume 28, Number 1, January 2015
- Orr Dunkelman, Nathan Keller, Adi Shamir:
Slidex Attacks on the Even-Mansour Encryption Scheme. 1-28 - Mihir Bellare, Dennis Hofheinz, Eike Kiltz
:
Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed? 29-48 - Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. 49-109 - Eli Biham, Rafi Chen, Antoine Joux:
Cryptanalysis of SHA-0 and Reduced SHA-1. 110-160 - Ämin Baumeler, Anne Broadbent:
Quantum Private Information Retrieval has Linear Communication Complexity. 161-175 - Florian Böhl, Dennis Hofheinz, Tibor Jager, Jessica Koch, Christoph Striecks:
Confined Guessing: New Signatures From Standard Assumptions. 176-208
Volume 28, Number 2, April 2015
- Eli Biham, Orr Dunkelman, Nathan Keller, Adi Shamir:
New Attacks on IDEA with at Least 6 Rounds. 209-239 - Mahdi Sajadieh, Mohammad Dakhilalian, Hamid Mala, Pouyan Sepehrdad:
Efficient Recursive Diffusion Layers for Block Ciphers and Hash Functions. 240-256 - Mario Lamberger, Florian Mendel, Martin Schläffer, Christian Rechberger, Vincent Rijmen:
The Rebound Attack and Subspace Distinguishers: Application to Whirlpool. 257-296 - Itay Berman, Iftach Haitner:
From Non-adaptive to Adaptive Pseudorandom Functions. 297-311 - Yehuda Lindell, Benny Pinkas:
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. 312-350 - Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohenberger, Abhi Shelat, Brent Waters:
Computing on Authenticated Data. 351-395
Volume 28, Number 3, July 2015
- Orr Dunkelman, Nathan Keller, Adi Shamir:
Improved Single-Key Attacks on 8-Round AES-192 and AES-256. 397-422 - Dennis Hofheinz, Victor Shoup:
GNUC: A New Universal Composability Framework. 423-508 - Eric Miles, Emanuele Viola:
On the Complexity of Constructing Pseudorandom Functions (Especially when They Don't Exist). 509-532 - Lior Malka:
How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge. 533-550 - Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss with a Dishonest Majority. 551-600 - Boaz Tsaban:
Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography. 601-622 - Ron Berman, Amos Fiat, Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kutylowski, Tomer Levinboim, Amnon Ta-Shma:
Provable Unlinkability Against Traffic Analysis with Low Message Overhead. 623-640 - Sven Schäge:
Tight Security for Signature Schemes Without Random Oracles. 641-670 - Benjamin Fuller, Adam O'Neill, Leonid Reyzin:
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. 671-717 - Hadi Soleimany, Céline Blondeau, Xiaoli Yu, Wenling Wu, Kaisa Nyberg, Huiling Zhang, Lei Zhang, Yanfeng Wang:
Reflection Cryptanalysis of PRINCE-Like Ciphers. 718-744
Volume 28, Number 4, October 2015
- Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation with Edge Corruptions. 745-768 - Gordon Procter, Carlos Cid:
On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes. 769-795 - James Aspnes, Zoë Diamadi, Aleksandr Yampolskiy, Kristian Gjøsteen, René Peralta:
Spreading Alerts Quietly and the Subgroup Escape Problem. 796-819 - Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai, Adam D. Smith:
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs. 820-843 - Mihir Bellare:
New Proofs for NMAC and HMAC: Security without Collision Resistance. 844-878 - Thomas Peyrin:
Collision Attack on Grindahl. 879-898
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-12-14 23:10 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:
