The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
    Concurrent Zero Knowledge Without Complexity Assumptions. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:1-20 [Conf]
  2. Moti Yung, Yunlei Zhao
    Interactive Zero-Knowledge with Restricted Random Oracles. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:21-40 [Conf]
  3. Ivan Damgård, Nelly Fazio, Antonio Nicolosi
    Non-interactive Zero-Knowledge from Homomorphic Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:41-59 [Conf]
  4. Adam Bender, Jonathan Katz, Ruggero Morselli
    Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:60-79 [Conf]
  5. Tatsuaki Okamoto
    Efficient Blind and Partially Blind Signatures Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:80-99 [Conf]
  6. Vladimir Kolesnikov, Charles Rackoff
    Key Exchange Using Passwords and Long Keys. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:100-119 [Conf]
  7. Dario Catalano, Yevgeniy Dodis, Ivan Visconti
    Mercurial Commitments: Minimal Assumptions and Efficient Constructions. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:120-144 [Conf]
  8. Chris Peikert, Alon Rosen
    Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:145-166 [Conf]
  9. Chris Peikert
    On Error Correction in the Exponent. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:167-183 [Conf]
  10. Yevgeniy Dodis, Prashant Puniya
    On the Relation Between the Ideal Cipher and the Random Oracle Models. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:184-206 [Conf]
  11. Stefan Dziembowski
    Intrusion-Resilience Via the Bounded-Storage Model. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:207-224 [Conf]
  12. Giovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish
    Perfectly Secure Password Protocols in the Bounded Retrieval Model. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:225-244 [Conf]
  13. Piotr Indyk, David P. Woodruff
    Polylogarithmic Private Approximations and Efficient Matching. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:245-264 [Conf]
  14. Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith
    Calibrating Noise to Sensitivity in Private Data Analysis. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:265-284 [Conf]
  15. Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft
    Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:285-304 [Conf]
  16. Zuzana Beerliová-Trubíniová, Martin Hirt
    Efficient Multi-party Computation with Dispute Control. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:305-328 [Conf]
  17. Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan
    Round-Optimal and Efficient Verifiable Secret Sharing. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:329-342 [Conf]
  18. Tal Malkin, Ryan Moriarty, Nikolai Yakovenko
    Generalized Environmental Security from Number Theoretic Assumptions. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:343-359 [Conf]
  19. Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov
    Games and the Impossibility of Realizable Ideal Functionality. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:360-379 [Conf]
  20. Ran Canetti, Jonathan Herzog
    Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:380-403 [Conf]
  21. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang
    Resource Fairness and Composability of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:404-428 [Conf]
  22. Hoeteck Wee
    Finding Pessiland. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:429-442 [Conf]
  23. Thomas Holenstein
    Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:443-461 [Conf]
  24. Chi-Jen Lu
    On the Complexity of Parallel Hardness Amplification for One-Way Functions. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:462-481 [Conf]
  25. Amos Beimel, Noam Livne
    On Matroids and Non-ideal Secret Sharing. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:482-501 [Conf]
  26. Chiu-Yuen Koo
    Secure Computation with Partial Message Loss. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:502-521 [Conf]
  27. Kobbi Nissim, Enav Weinreb
    Communication Efficient Secure Linear Algebra. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:522-541 [Conf]
  28. Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung
    Threshold and Proactive Pseudo-Random Permutations. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:542-560 [Conf]
  29. Charanjit S. Jutla
    PRF Domain Extension Using DAGs. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:561-580 [Conf]
  30. Eike Kiltz
    Chosen-Ciphertext Security from Tag-Based Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:581-600 [Conf]
  31. Yevgeniy Dodis, Krzysztof Pietrzak, Bartosz Przydatek
    Separating Sources for Encryption and Secret Sharing. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:601-616 [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