Skip to content

Advances in Cryptology

CRYPTO

A*

CORE rank

CORE rank (raw)

A*

Fields of research

Cybersecurity and Privacy

Papers indexed

2,632

1981–2026

Papers per year

1981189 peak2026

CRYPTO papers

2,632 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2005Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems.Omer Barkol, Yuval Ishai
2005Secure Computation Without Authentication.Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
2005Impossibility and Feasibility Results for Zero Knowledge with Public Keys.Jol Alwen, Giuseppe Persiano, Ivan Visconti
2005Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions.Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi
2004Optimal Perfectly Secure Message Transmission.K. Srinathan, Arvind Narayanan, C. Pandu Rangan
2004Compressed Pairings.Michael Scott, Paulo S. L. M. Barreto
2004Security of Random Feistel Schemes with 5 or More Rounds.Jacques Patarin
2004Signed Binary Representations Revisited.Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, Tsuyoshi Takagi
2004Non-interactive Timestamping in the Bounded Storage Model.Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
2004An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators.Hvard Molland, Tor Helleseth
2004Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.Alexander May
2004Faster Correlation Attack on Bluetooth Keystream Generator E0.Yi Lu, Serge Vaudenay
2004Security, Liberty, and Electronic Communications.Susan Landau
2004A New Paradigm of Hybrid Encryption Scheme.Kaoru Kurosawa, Yvo Desmedt
2004Round-Optimal Secure Two-Party Computation.Jonathan Katz, Rafail Ostrovsky
2004Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions.Antoine Joux
2004Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?Chun-Yuan Hsiao, Leonid Reyzin
2004Complete Classification of Bilinear Hard-Core Functions.Thomas Holenstein, Ueli M. Maurer, Johan Sjdin
2004Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers.Philip Hawkes, Gregory G. Rose
2004Efficient Tree-Based Revocation in Groups of Low-State Devices.Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia
2004How to Compress Rabin Ciphertexts and Signatures (and More).Craig Gentry
2004Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks.Rosario Gennaro
2004Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness.Matthias Fitzi, Stefan Wolf, Jrg Wullschleger
2004Privacy-Preserving Datamining on Vertically Partitioned Databases.Cynthia Dwork, Kobbi Nissim
2004Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes.Yevgeniy Dodis, Rosario Gennaro, Johan Hstad, Hugo Krawczyk, Tal Rabin
1,7011,725 of 2,632← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.