The SCEAS System
Navigation Menu

Conferences in DBLP

EUROCRYPT (eurocrypt)
2003 (conf/eurocrypt/2003)

  1. Antoine Joux
    Cryptanalysis of the EMD Mode of Operation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:1-16 [Conf]
  2. Pascal Junod
    On the Optimality of Linear, Differential, and Sequential Distinguishers. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:17-32 [Conf]
  3. Alex Biryukov, Christophe De Cannière, An Braeken, Bart Preneel
    A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:33-50 [Conf]
  4. Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger
    Two-Threshold Broadcast and Detectable Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:51-67 [Conf]
  5. Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
    On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:68-86 [Conf]
  6. Benny Pinkas
    Fair Secure Two-Party Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:87-105 [Conf]
  7. Kris Gaj, Arkadiusz Orlowski
    Facts and Myths of Enigma: Breaking Stereotypes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:106-122 [Conf]
  8. Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu
    Resettable Zero-Knowledge in the Weak Public-Key Model. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:123-139 [Conf]
  9. Daniele Micciancio, Erez Petrank
    Simulatable Commitments and Efficient Concurrent Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:140-159 [Conf]
  10. Rafael Pass
    Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:160-176 [Conf]
  11. Juan A. Garay, Philip D. MacKenzie, Ke Yang
    Strengthening Zero-Knowledge Protocols Using Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:177-194 [Conf]
  12. Gustav Hast
    Nearly One-Sided Tests and the Goldreich-Levin Predicate. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:195-210 [Conf]
  13. Jonathan Katz
    Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:211-228 [Conf]
  14. Daniel Augot, Matthieu Finiasz
    A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:229-240 [Conf]
  15. Yehuda Lindell
    A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:241-254 [Conf]
  16. Ran Canetti, Shai Halevi, Jonathan Katz
    A Forward-Secure Public-Key Encryption Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:255-271 [Conf]
  17. Craig Gentry
    Certificate-Based Encryption and the Certificate Revocation Problem. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:272-293 [Conf]
  18. Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford
    CAPTCHA: Using Hard AI Problems for Security. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:294-311 [Conf]
  19. Yevgeniy Dodis, Jee Hea An
    Concealment and Its Applications to Authenticated Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:312-329 [Conf]
  20. Patrik Ekdahl, Willi Meier, Thomas Johansson
    Predicting the Shrinking Generator with Fixed Connections. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:330-344 [Conf]
  21. Nicolas Courtois, Willi Meier
    Algebraic Attacks on Stream Ciphers with Linear Feedback. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:345-359 [Conf]
  22. Reynald Lercier, David Lubicz
    Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:360-373 [Conf]
  23. Florian Hess
    The GHS Attack Revisited. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:374-387 [Conf]
  24. Mathieu Ciet, Tanja Lange, Francesco Sica, Jean-Jacques Quisquater
    Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:388-400 [Conf]
  25. Eu-Jin Goh, Stanislaw Jarecki
    A Signature Scheme as Secure as the Diffie-Hellman Problem. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:401-415 [Conf]
  26. Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham
    Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:416-432 [Conf]
  27. Michael Szydlo
    Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:433-448 [Conf]
  28. Jacques Stern
    Why Provable Security Matters? [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:449-461 [Conf]
  29. Pierre-Alain Fouque, Guillaume Poupard
    On the Security of RDSA. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:462-476 [Conf]
  30. Eonkyung Lee, Je Hong Park
    Cryptanalysis of the Public-Key Encryption Based on Braid Groups. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:477-490 [Conf]
  31. Mihir Bellare, Tadayoshi Kohno
    A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:491-506 [Conf]
  32. Mario Di Raimondo, Rosario Gennaro
    Provably Secure Threshold Password-Authenticated Key Exchange. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:507-523 [Conf]
  33. Rosario Gennaro, Yehuda Lindell
    A Framework for Password-Based Authenticated Key Exchange. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:524-543 [Conf]
  34. Ueli M. Maurer, Krzysztof Pietrzak
    The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:544-561 [Conf]
  35. Renato Renner, Stefan Wolf
    New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:562-577 [Conf]
  36. Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Round Efficiency of Multi-party Computation with a Dishonest Majority. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:578-595 [Conf]
  37. Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz
    Efficient Multi-party Computation over Rings. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:596-613 [Conf]
  38. Mihir Bellare, Daniele Micciancio, Bogdan Warinschi
    Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:614-629 [Conf]
  39. Aggelos Kiayias, Moti Yung
    Extracting Group Signatures from Traitor Tracing Schemes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:630-648 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002