Conferences in DBLP

ASIACRYPT (asiacrypt)
2008 (conf/asiacrypt/2008)

1. 
   MPC vs. SFE : Unconditional and Computational Security. [Citation Graph (, )][DBLP]
   
   
2. 
   Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes. [Citation Graph (, )][DBLP]
   
   
3. 
   Graph Design for Secure Multiparty Computation over Non-Abelian Groups. [Citation Graph (, )][DBLP]
   
   
4. 
   Some Perspectives on Complexity-Based Cryptography. [Citation Graph (, )][DBLP]
   
   
5. 
   A Modular Security Analysis of the TLS Handshake Protocol. [Citation Graph (, )][DBLP]
   
   
6. 
   Ambiguous Optimistic Fair Exchange. [Citation Graph (, )][DBLP]
   
   
7. 
   Compact Proofs of Retrievability. [Citation Graph (, )][DBLP]
   
   
8. 
   On the Security of HB# against a Man-in-the-Middle Attack. [Citation Graph (, )][DBLP]
   
   
9. 
   Hash Functions from Sigma Protocols and Improvements to VSH. [Citation Graph (, )][DBLP]
   
   
10. 
    Slide Attacks on a Class of Hash Functions. [Citation Graph (, )][DBLP]
    
    
11. 
    Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography. [Citation Graph (, )][DBLP]
    
    
12. 
    Universally Composable Adaptive Oblivious Transfer. [Citation Graph (, )][DBLP]
    
    
13. 
    A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting. [Citation Graph (, )][DBLP]
    
    
14. 
    Towards Robust Computation on Encrypted Data. [Citation Graph (, )][DBLP]
    
    
15. 
    Efficient Protocols for Set Membership and Range Proofs. [Citation Graph (, )][DBLP]
    
    
16. 
    Preimage Attacks on 3, 4, and 5-Pass HAVAL. [Citation Graph (, )][DBLP]
    
    
17. 
    How to Fill Up Merkle-Damgård Hash Functions. [Citation Graph (, )][DBLP]
    
    
18. 
    Limits of Constructive Security Proofs. [Citation Graph (, )][DBLP]
    
    
19. 
    Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption. [Citation Graph (, )][DBLP]
    
    
20. 
    Twisted Edwards Curves Revisited. [Citation Graph (, )][DBLP]
    
    
21. 
    On the Validity of the phi-Hiding Assumption in Cryptographic Protocols. [Citation Graph (, )][DBLP]
    
    
22. 
    Chosen Ciphertext Security with Optimal Ciphertext Overhead. [Citation Graph (, )][DBLP]
    
    
23. 
    Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. [Citation Graph (, )][DBLP]
    
    
24. 
    Rigorous and Efficient Short Lattice Vectors Enumeration. [Citation Graph (, )][DBLP]
    
    
25. 
    Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits. [Citation Graph (, )][DBLP]
    
    
26. 
    An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity. [Citation Graph (, )][DBLP]
    
    
27. 
    An Improved Impossible Differential Attack on MISTY1. [Citation Graph (, )][DBLP]
    
    
28. 
    Generalized Identity Based and Broadcast Encryption Schemes. [Citation Graph (, )][DBLP]
    
    
29. 
    Speeding Up the Pollard Rho Method on Prime Fields. [Citation Graph (, )][DBLP]
    
    
30. 
    Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems. [Citation Graph (, )][DBLP]
    
    
31. 
    OAEP Is Secure under Key-Dependent Messages. [Citation Graph (, )][DBLP]
    
    
32. 
    Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks. [Citation Graph (, )][DBLP]
    
    
33. 
    A New Attack on the LEX Stream Cipher. [Citation Graph (, )][DBLP]
    
    
34. 
    Breaking the F-FCSR-H Stream Cipher in Real Time. [Citation Graph (, )][DBLP]