default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROCRYPT 2003: Warsaw, Poland
- Eli Biham:
Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings. Lecture Notes in Computer Science 2656, Springer 2003, ISBN 3-540-14039-5
Cryptanalysis I
- Antoine Joux:
Cryptanalysis of the EMD Mode of Operation. 1-16 - Pascal Junod
:
On the Optimality of Linear, Differential, and Sequential Distinguishers. 17-32 - Alex Biryukov, Christophe De Cannière, An Braeken, Bart Preneel:
A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. 33-50
Secure Multi-party Computation I
- Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger:
Two-Threshold Broadcast and Detectable Multi-party Computation. 51-67 - Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. 68-86 - Benny Pinkas:
Fair Secure Two-Party Computation. 87-105
Invited Talk I
- Kris Gaj, Arkadiusz Orlowski:
Facts and Myths of Enigma: Breaking Stereotypes. 106-122
Zero-Knowledge Protocols
- Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu:
Resettable Zero-Knowledge in the Weak Public-Key Model. 123-139 - Daniele Micciancio, Erez Petrank:
Simulatable Commitments and Efficient Concurrent Zero-Knowledge. 140-159 - Rafael Pass:
Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. 160-176 - Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. 177-194
Foundations and Complexity Theoretic Security
- Gustav Hast:
Nearly One-Sided Tests and the Goldreich-Levin Predicate. 195-210 - Jonathan Katz:
Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. 211-228
Public Key Encryption
- Daniel Augot, Matthieu Finiasz:
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem. 229-240 - Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. 241-254 - Ran Canetti, Shai Halevi, Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme. 255-271 - Craig Gentry:
Certificate-Based Encryption and the Certificate Revocation Problem. 272-293
New Primitives
- Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford:
CAPTCHA: Using Hard AI Problems for Security. 294-311 - Yevgeniy Dodis, Jee Hea An:
Concealment and Its Applications to Authenticated Encryption. 312-329
Cryptanalysis II
- Patrik Ekdahl, Willi Meier, Thomas Johansson:
Predicting the Shrinking Generator with Fixed Connections. 330-344 - Nicolas T. Courtois, Willi Meier:
Algebraic Attacks on Stream Ciphers with Linear Feedback. 345-359
Elliptic Curves Cryptography
- Reynald Lercier, David Lubicz:
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time. 360-373 - Florian Hess:
The GHS Attack Revisited. 374-387 - Mathieu Ciet, Tanja Lange, Francesco Sica, Jean-Jacques Quisquater:
Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms. 388-400
Digital Signatures
- Eu-Jin Goh, Stanislaw Jarecki:
A Signature Scheme as Secure as the Diffie-Hellman Problem. 401-415 - Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham:
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. 416-432 - Michael Szydlo:
Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures. 433-448
Invited Talk II
- Jacques Stern:
Why Provable Security Matters? 449-461
Cryptanalysis III
- Pierre-Alain Fouque, Guillaume Poupard:
On the Security of RDSA. 462-476 - Eonkyung Lee, Je Hong Park:
Cryptanalysis of the Public-Key Encryption Based on Braid Groups. 477-490 - Mihir Bellare, Tadayoshi Kohno:
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications. 491-506
Key Exchange
- Mario Di Raimondo, Rosario Gennaro:
Provably Secure Threshold Password-Authenticated Key Exchange. 507-523 - Rosario Gennaro, Yehuda Lindell:
A Framework for Password-Based Authenticated Key Exchange. 524-543
Information Theoretic Cryptography
- Ueli M. Maurer, Krzysztof Pietrzak:
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. 544-561 - Renato Renner, Stefan Wolf:
New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction. 562-577
Secure Multi-party Computation II
- Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Round Efficiency of Multi-party Computation with a Dishonest Majority. 578-595 - Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz:
Efficient Multi-party Computation over Rings. 596-613
Group Signatures
- Mihir Bellare, Daniele Micciancio, Bogdan Warinschi:
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. 614-629 - Aggelos Kiayias, Moti Yung:
Extracting Group Signatures from Traitor Tracing Schemes. 630-648
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 2026-09-01 03:17 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
