International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Papers from CRYPTO 2004

Year
Venue
Title
2004
CRYPTO
14 Years of Chosen Ciphertext Security: A Survey of Public Key Encryption
★Invited talk
Victor Shoup
2004
CRYPTO
A New Paradigm of Hybrid Encryption Scheme
Kaoru Kurosawa Yvo Desmedt
2004
CRYPTO
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
Masayuki Abe Serge Fehr
2004
CRYPTO
An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators
Håvard Molland Tor Helleseth
2004
CRYPTO
Asymptotically Optimal Communication for Torus-Based Cryptography
Marten van Dijk David P. Woodruff
2004
CRYPTO
Complete Classification of Bilinear Hard-Core Functions
Thomas Holenstein Ueli Maurer Johan Sjödin
2004
CRYPTO
Compressed Pairings
Michael Scott Paulo S. L. M. Barreto
2004
CRYPTO
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
Alexander May
2004
CRYPTO
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
Giovanni Di Crescenzo Giuseppe Persiano Ivan Visconti
2004
CRYPTO
Efficient Tree-Based Revocation in Groups of Low-State Devices
Michael T. Goodrich Jonathan Z. Sun Roberto Tamassia
2004
CRYPTO
Faster Correlation Attack on Bluetooth Keystream Generator E0
Yi Lu 0002 Serge Vaudenay
2004
CRYPTO
Feistel Schemes and Bi-linear Cryptanalysis
Nicolas Courtois
2004
CRYPTO
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Chun-Yuan Hsiao Leonid Reyzin
2004
CRYPTO
How to Compress Rabin Ciphertexts and Signatures (and More)
Craig Gentry
2004
CRYPTO
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange
Dario Catalano David Pointcheval Thomas Pornin
2004
CRYPTO
Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks
Rosario Gennaro
2004
CRYPTO
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
★ 2019 IACR Test of Time Award
Antoine Joux
2004
CRYPTO
Near-Collisions of SHA-0
Eli Biham Rafi Chen
2004
CRYPTO
Non-interactive Timestamping in the Bounded Storage Model
Tal Moran Ronen Shaltiel Amnon Ta-Shma
2004
CRYPTO
On Multiple Linear Approximations
Alex Biryukov Christophe De Cannière Michaël Quisquater
2004
CRYPTO
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
Qi Cheng
2004
CRYPTO
Optimal Perfectly Secure Message Transmission
K. Srinathan Arvind Narayanan C. Pandu Rangan
2004
CRYPTO
Privacy-Preserving Datamining on Vertically Partitioned Databases
Cynthia Dwork Kobbi Nissim
2004
CRYPTO
Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness
Matthias Fitzi Stefan Wolf Jürg Wullschleger
2004
CRYPTO
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes
Yevgeniy Dodis Rosario Gennaro Johan Håstad Hugo Krawczyk Tal Rabin
2004
CRYPTO
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Philip Hawkes Gregory G. Rose
2004
CRYPTO
Round-Optimal Secure Two-Party Computation
Jonathan Katz Rafail Ostrovsky
2004
CRYPTO
Secure Identity Based Encryption Without Random Oracles
Dan Boneh Xavier Boyen
2004
CRYPTO
Security of Random Feistel Schemes with 5 or More Rounds
Jacques Patarin
2004
CRYPTO
Security, Liberty, and Electronic Communications
★Invited paper
Susan Landau
2004
CRYPTO
Short Group Signatures
Dan Boneh Xavier Boyen Hovav Shacham
2004
CRYPTO
Signature Schemes and Anonymous Credentials from Bilinear Maps
Jan Camenisch Anna Lysyanskaya
2004
CRYPTO
Signed Binary Representations Revisited
Katsuyuki Okeya Katja Schmidt-Samoa Christian Spahn Tsuyoshi Takagi
2004
CRYPTO
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
Mihir Bellare Adriana Palacio
2004
CRYPTO
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
Ivan Damgård Serge Fehr Louis Salvail