Conferences in DBLP

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

1. 
   An Optimally Fair Coin Toss. [Citation Graph (, )][DBLP]
   
   
2. 
   Complete Fairness in Multi-party Computation without an Honest Majority. [Citation Graph (, )][DBLP]
   
   
3. 
   Fairness with an Honest Minority and a Rational Majority. [Citation Graph (, )][DBLP]
   
   
4. 
   Purely Rational Secret Sharing (Extended Abstract). [Citation Graph (, )][DBLP]
   
   
5. 
   Some Recent Progress in Lattice-Based Cryptography. [Citation Graph (, )][DBLP]
   
   
6. 
   Non-malleable Obfuscation. [Citation Graph (, )][DBLP]
   
   
7. 
   Simulation-Based Concurrent Non-malleable Commitments and Decommitments. [Citation Graph (, )][DBLP]
   
   
8. 
   Proofs of Retrievability via Hardness Amplification. [Citation Graph (, )][DBLP]
   
   
9. 
   Security Amplification for InteractiveCryptographic Primitives. [Citation Graph (, )][DBLP]
   
   
10. 
    Composability and On-Line Deniability of Authentication. [Citation Graph (, )][DBLP]
    
    
11. 
    Authenticated Adversarial Routing. [Citation Graph (, )][DBLP]
    
    
12. 
    Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. [Citation Graph (, )][DBLP]
    
    
13. 
    On the (Im)Possibility of Key Dependent Encryption. [Citation Graph (, )][DBLP]
    
    
14. 
    On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. [Citation Graph (, )][DBLP]
    
    
15. 
    Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security. [Citation Graph (, )][DBLP]
    
    
16. 
    Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. [Citation Graph (, )][DBLP]
    
    
17. 
    Realistic Failures in Secure Multi-party Computation. [Citation Graph (, )][DBLP]
    
    
18. 
    Secure Arithmetic Computation with No Honest Majority. [Citation Graph (, )][DBLP]
    
    
19. 
    Universally Composable Multiparty Computation with Partially Isolated Parties. [Citation Graph (, )][DBLP]
    
    
20. 
    Oblivious Transfer from Weak Noisy Channels. [Citation Graph (, )][DBLP]
    
    
21. 
    Composing Quantum Protocols in a Classical Environment. [Citation Graph (, )][DBLP]
    
    
22. 
    LEGO for Two-Party Secure Computation. [Citation Graph (, )][DBLP]
    
    
23. 
    Simple, Black-Box Constructions of Adaptively Secure Protocols. [Citation Graph (, )][DBLP]
    
    
24. 
    Black-Box Constructions of Two-Party Protocols from One-Way Functions. [Citation Graph (, )][DBLP]
    
    
25. 
    Chosen-Ciphertext Security via Correlated Products. [Citation Graph (, )][DBLP]
    
    
26. 
    Hierarchical Identity Based Encryption with Polynomially Many Levels. [Citation Graph (, )][DBLP]
    
    
27. 
    Predicate Privacy in Encryption Systems. [Citation Graph (, )][DBLP]
    
    
28. 
    Simultaneous Hardcore Bits and Cryptography against Memory Attacks. [Citation Graph (, )][DBLP]
    
    
29. 
    The Differential Privacy Frontier (Extended Abstract). [Citation Graph (, )][DBLP]
    
    
30. 
    How Efficient Can Memory Checking Be?. [Citation Graph (, )][DBLP]
    
    
31. 
    Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. [Citation Graph (, )][DBLP]
    
    
32. 
    Secret Sharing and Non-Shannon Information Inequalities. [Citation Graph (, )][DBLP]
    
    
33. 
    Weak Verifiable Random Functions. [Citation Graph (, )][DBLP]
    
    
34. 
    Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. [Citation Graph (, )][DBLP]
    
    
35. 
    Towards a Theory of Extractable Functions. [Citation Graph (, )][DBLP]