The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Carl Bosley, Yevgeniy Dodis
    Does Privacy Require True Randomness? [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:1-20 [Conf]
  2. Saurabh Panjwani
    Tackling Adaptive Corruptions in Multicast Encryption Protocols. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:21-40 [Conf]
  3. Jörn Müller-Quade, Dominique Unruh
    Long-Term Security and Universal Composability. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:41-60 [Conf]
  4. Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish
    Universally Composable Security with Global Setup. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:61-85 [Conf]
  5. Krzysztof Pietrzak, Douglas Wikström
    Parallel Repetition of Computationally Sound Protocols Revisited. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:86-102 [Conf]
  6. Hoeteck Wee
    Lower Bounds for Non-interactive Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:103-117 [Conf]
  7. Masayuki Abe, Serge Fehr
    Perfect NIZK with Adaptive Soundness. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:118-136 [Conf]
  8. Yonatan Aumann, Yehuda Lindell
    Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:137-156 [Conf]
  9. Michael Backes, Jörn Müller-Quade, Dominique Unruh
    On the Necessity of Rewinding in Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:157-173 [Conf]
  10. Oded Goldreich
    On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:174-193 [Conf]
  11. Shafi Goldwasser, Guy N. Rothblum
    On Best-Possible Obfuscation. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:194-213 [Conf]
  12. Dennis Hofheinz, John Malone-Lee, Martijn Stam
    Obfuscation for Cryptographic Purposes. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:214-232 [Conf]
  13. Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan
    Securely Obfuscating Re-encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:233-252 [Conf]
  14. Amos Beimel, Matthew K. Franklin
    Weakly-Private Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:253-272 [Conf]
  15. Jaume Martí-Farré, Carles Padró
    On Secret Sharing Schemes, Matroids and Polymatroids. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:273-290 [Conf]
  16. Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin
    Secure Linear Algebra Using Linearly Recurrent Sequences. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:291-310 [Conf]
  17. Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, S. Harsha Vardhan
    Towards Optimal and Efficient Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:311-322 [Conf]
  18. Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell
    Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:323-341 [Conf]
  19. Douglas Wikström
    Designated Confirmer Signatures Revisited. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:342-361 [Conf]
  20. Nicholas Hopper, David Molnar, David Wagner
    From Weak to Strong Watermarking. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:362-382 [Conf]
  21. Amos Beimel, Renen Hallak, Kobbi Nissim
    Private Approximation of Clustering and Vertex Cover. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:383-403 [Conf]
  22. Remo Meier, Bartosz Przydatek, Jürg Wullschleger
    Robuster Combiners for Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:404-418 [Conf]
  23. Hoeteck Wee
    One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:419-433 [Conf]
  24. Yael Gertner, Tal Malkin, Steven Myers
    Towards a Separation of Semantic and CCA Security for Public Key Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:434-455 [Conf]
  25. Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Renato Renner
    Unifying Classical and Quantum Key Distillation. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:456-478 [Conf]
  26. David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish
    Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:479-498 [Conf]
  27. Michel Abdalla, Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, Rainer Steinwandt
    (Password) Authenticated Key Establishment: From 2-Party to Group. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:499-514 [Conf]
  28. Melissa Chase
    Multi-authority Attribute Based Encryption. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:515-534 [Conf]
  29. Dan Boneh, Brent Waters
    Conjunctive, Subset, and Range Queries on Encrypted Data. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:535-554 [Conf]
  30. Ben Adida, Douglas Wikström
    How to Shuffle in Public. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:555-574 [Conf]
  31. Yuval Ishai, Anat Paskin
    Evaluating Branching Programs on Encrypted Data. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:575-594 [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