default search action
IACR Cryptology ePrint Archive, Volume 1998
Volume 1998, 1998
- Gerrit Bleumer:
On Protocol Divertibility. 1 - Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof. 2 - Benny Chor, Niv Gilboa, Moni Naor:
Private Information Retrieval by Keywords. 3 - Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky:
Universal Service Providers for Database Private Information Retrieval. 4 - Oded Goldreich, Shafi Goldwasser:
On the possibility of basing Cryptography on the assumption that P ≠ NP. 5 - Ronald Cramer, Victor Shoup:
A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. 6 - Mihir Bellare, Juan A. Garay, Tal Rabin:
Fast Batch Verification for Modular Exponentiation and Digital Signatures. 7 - Rosario Gennaro, Daniele Micciancio, Tal Rabin:
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products. 8 - Mihir Bellare, Ran Canetti, Hugo Krawczyk:
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols. 9 - Hugo Krawczyk, Tal Rabin:
Chameleon Hashing and Signatures. 10 - Ran Canetti, Oded Goldreich, Shai Halevi:
The Random Oracle Methodology, Revisited. 11 - Ran Canetti, Shai Halevi, Amir Herzberg:
Maintaining Authenticated Communication in the Presence of Break-ins. 12 - Yael Gertner, Shafi Goldwasser, Tal Malkin:
A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Data Replication). 13 - Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. 14 - Shai Halevi, Silvio Micali:
More on Proofs of Knowledge. 15 - (Withdrawn) Quantum Computers Render Quantum Key Distribution Unconditionally Secure Over Arbitrarily Long Distances. 16
- Hoi Fung Chau, Hoi-Kwong Lo:
Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment). 17 - Ran Canetti:
Security and Composition of Multi-party Cryptographic Protocols. 18 - Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan:
Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems. 19 - Claus-Peter Schnorr:
Almost All Discrete Log Bits Are Simultaneously Secure. 20 - Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway:
Relations among Notions of Security for Public-Key Encryption Schemes. 21 - Hoi-Kwong Lo:
Insecurity of Quantum Computations. 22 - William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan:
Security amplification by composition: The case of doubly-iterated, ideal ciphers. 23 - John O. Pliam:
The Disparity between Work and Entropy in Cryptology. 24 - Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure Distributed Storage and Retrieval. 25 - Oded Goldreich, Salil P. Vadhan:
Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK. 26
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-12-26 00:37 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: