The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Omer Reingold, Luca Trevisan, Salil P. Vadhan
    Notions of Reducibility between Cryptographic Primitives. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:1-20 [Conf]
  2. Ueli M. Maurer, Renato Renner, Clemens Holenstein
    Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:21-39 [Conf]
  3. Ran Canetti, Oded Goldreich, Shai Halevi
    On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:40-57 [Conf]
  4. Dennis Hofheinz, Jörn Müller-Quade
    Universally Composable Commitments Using Random Oracles. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:58-76 [Conf]
  5. Shafi Goldwasser, Erez Waisbard
    Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:77-100 [Conf]
  6. Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan
    List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:101-120 [Conf]
  7. Boaz Barak, Rafael Pass
    On the Possibility of One-Message Weak Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:121-132 [Conf]
  8. Daniele Micciancio, Bogdan Warinschi
    Soundness of Formal Encryption in the Presence of Active Adversaries. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:133-151 [Conf]
  9. Jens Groth
    Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:152-170 [Conf]
  10. Philip D. MacKenzie, Michael K. Reiter, Ke Yang
    Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:171-190 [Conf]
  11. Alon Rosen
    A Note on Constant-Round Zero-Knowledge Proofs for NP. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:191-202 [Conf]
  12. Yehuda Lindell
    Lower Bounds for Concurrent Self Composition. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:203-222 [Conf]
  13. Ronald Cramer, Ivan Damgård
    Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:223-237 [Conf]
  14. Amos Beimel, Tal Malkin
    A Quantitative Approach to Reductions in Secure Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:238-257 [Conf]
  15. Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, Tal Rabin
    Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:258-277 [Conf]
  16. Silvio Micali, Leonid Reyzin
    Physically Observable Cryptography (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:278-296 [Conf]
  17. Juan A. Garay
    Efficient and Universally Composable Committed Oblivious Transfer and Applications. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:297-316 [Conf]
  18. Douglas Wikström
    A Universally Composable Mix-Net. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:317-335 [Conf]
  19. Michael Backes, Birgit Pfitzmann, Michael Waidner
    A General Composition Theorem for Secure Reactive Systems. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:336-354 [Conf]
  20. Ivan Damgård, Serge Fehr, Kirill Morozov, Louis Salvail
    Unfair Noisy Channels and Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:355-373 [Conf]
  21. Claude Crépeau, Paul Dumais, Dominic Mayers, Louis Salvail
    Computational Collapse of Quantum State with Application to Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:374-393 [Conf]
  22. Iftach Haitner
    Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:394-409 [Conf]
  23. Ueli M. Maurer, Krzysztof Pietrzak
    Composition of Random Systems: When Two Weak Make One Strong. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:410-427 [Conf]
  24. Minh-Huyen Nguyen, Salil P. Vadhan
    Simpler Session-Key Generation from Short Random Passwords. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:428-445 [Conf]
  25. Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
    Constant-Round Oblivious Transfer in the Bounded Storage Model. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:446-472 [Conf]
  26. Tamir Tassa
    Hierarchical Threshold Secret Sharing. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:473-490 [Conf]
  27. Mark Johnson, David Wagner, Kannan Ramchandran
    On Compressing Encrypted Data without the Encryption Key. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:491-504 [Conf]
  28. Ronald L. Rivest
    On the Notion of Pseudo-Free Groups. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:505-521 [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