The SCEAS System
Navigation Menu

Conferences in DBLP

Theory of Cryptography (tcc)
2005 (conf/tcc/2005)

  1. Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson
    Optimal Error Correction Against Computationally Bounded Noise. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:1-16 [Conf]
  2. Ran Canetti, Shai Halevi, Michael Steiner
    Hardness Amplification of Weakly Verifiable Puzzles. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:17-33 [Conf]
  3. Henry Lin, Luca Trevisan, Hoeteck Wee
    On Hardness Amplification of One-Way Functions. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:34-49 [Conf]
  4. Jens Groth
    Cryptography in Subgroups of Zn. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:50-65 [Conf]
  5. Moni Naor, Asaf Nussboim, Eran Tromer
    Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:66-85 [Conf]
  6. Dennis Hofheinz, Dominique Unruh
    Comparing Two Notions of Simulatability. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:86-103 [Conf]
  7. Manoj Prabhakaran, Amit Sahai
    Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:104-127 [Conf]
  8. Jonathan Katz, Yehuda Lindell
    Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:128-149 [Conf]
  9. Ran Canetti, Shai Halevi, Jonathan Katz
    Adaptively-Secure, Non-interactive Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:150-168 [Conf]
  10. Daniele Micciancio, Saurabh Panjwani
    Adaptive Security of Symbolic Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:169-187 [Conf]
  11. Yevgeniy Dodis, Jonathan Katz
    Chosen-Ciphertext Security of Multiple Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:188-209 [Conf]
  12. Michael Backes, Christian Cachin
    Public-Key Steganography with Active Attacks. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:210-226 [Conf]
  13. Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell
    Upper and Lower Bounds on Black-Box Steganography. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:227-244 [Conf]
  14. Matt Lepinski, Silvio Micali, Abhi Shelat
    Fair-Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:245-263 [Conf]
  15. Susan Hohenberger, Anna Lysyanskaya
    How to Securely Outsource Cryptographic Computations. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:264-282 [Conf]
  16. Eike Kiltz, Gregor Leander, John Malone-Lee
    Secure Computation of the Mean and Related Statistics. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:283-302 [Conf]
  17. Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
    Keyword Search and Oblivious Pseudorandom Functions. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:303-324 [Conf]
  18. Dan Boneh, Eu-Jin Goh, Kobbi Nissim
    Evaluating 2-DNF Formulas on Ciphertexts. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:325-341 [Conf]
  19. Ronald Cramer, Ivan Damgård, Yuval Ishai
    Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:342-362 [Conf]
  20. Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee
    Toward Privacy in Public Databases. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:363-385 [Conf]
  21. Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim
    The Universal Composable Security of Quantum Key Distribution. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:386-406 [Conf]
  22. Renato Renner, Robert König
    Universally Composable Privacy Amplification Against Quantum Adversaries. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:407-425 [Conf]
  23. Waka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto
    A Universally Composable Secure Channel Based on the KEM-DEM Framework. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:426-444 [Conf]
  24. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Sufficient Conditions for Collision-Resistant Hashing. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:445-456 [Conf]
  25. Minh-Huyen Nguyen
    The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:457-475 [Conf]
  26. Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan
    On the Relationships Between Notions of Simulation-Based Security. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:476-494 [Conf]
  27. Maria Isabel Gonzalez Vasco, Consuelo Martínez, Rainer Steinwandt, Jorge Luis Villar
    A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:495-509 [Conf]
  28. Stanislaw Jarecki, Nitesh Saxena
    Further Simplifications in Proactive RSA Signatures. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:510-528 [Conf]
  29. Shafi Goldwasser, Dmitriy Kharchenko
    Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:529-555 [Conf]
  30. Yevgeniy Dodis, Adam Smith
    Entropic Security and the Encryption of High Entropy Messages. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:556-577 [Conf]
  31. Yan Zong Ding
    Error Correction in the Bounded Storage Model. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:578-599 [Conf]
  32. Amos Beimel, Tamir Tassa, Enav Weinreb
    Characterizing Ideal Weighted Threshold Secret Sharing. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:600-619 [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