Conferences in DBLP

EUROCRYPT (eurocrypt)
2010 (conf/eurocrypt/2010)

1. 
   On Ideal Lattices and Learning with Errors over Rings. [Citation Graph (, )][DBLP]
   
   
2. 
   Fully Homomorphic Encryption over the Integers. [Citation Graph (, )][DBLP]
   
   
3. 
   Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups. [Citation Graph (, )][DBLP]
   
   
4. 
   Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption. [Citation Graph (, )][DBLP]
   
   
5. 
   Secure Obfuscation for Encrypted Signatures. [Citation Graph (, )][DBLP]
   
   
6. 
   Public-Key Encryption in the Bounded-Retrieval Model. [Citation Graph (, )][DBLP]
   
   
7. 
   Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases. [Citation Graph (, )][DBLP]
   
   
8. 
   Partial Fairness in Secure Two-Party Computation. [Citation Graph (, )][DBLP]
   
   
9. 
   Secure Message Transmission with Small Public Discussion. [Citation Graph (, )][DBLP]
   
   
10. 
    On the Impossibility of Three-Move Blind Signature Schemes. [Citation Graph (, )][DBLP]
    
    
11. 
    Efficient Device-Independent Quantum Key Distribution. [Citation Graph (, )][DBLP]
    
    
12. 
    New Generic Algorithms for Hard Knapsacks. [Citation Graph (, )][DBLP]
    
    
13. 
    Lattice Enumeration Using Extreme Pruning. [Citation Graph (, )][DBLP]
    
    
14. 
    Algebraic Cryptanalysis of McEliece Variants with Compact Keys. [Citation Graph (, )][DBLP]
    
    
15. 
    Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds. [Citation Graph (, )][DBLP]
    
    
16. 
    Cryptography between Wonderland and Underland. [Citation Graph (, )][DBLP]
    
    
17. 
    Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others. [Citation Graph (, )][DBLP]
    
    
18. 
    Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR. [Citation Graph (, )][DBLP]
    
    
19. 
    Computational Soundness, Co-induction, and Encryption Cycles. [Citation Graph (, )][DBLP]
    
    
20. 
    Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks. [Citation Graph (, )][DBLP]
    
    
21. 
    Cryptographic Agility and Its Relation to Circular Encryption. [Citation Graph (, )][DBLP]
    
    
22. 
    Bounded Key-Dependent Message Security. [Citation Graph (, )][DBLP]
    
    
23. 
    Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. [Citation Graph (, )][DBLP]
    
    
24. 
    Adaptively Secure Broadcast. [Citation Graph (, )][DBLP]
    
    
25. 
    Universally Composable Quantum Multi-party Computation. [Citation Graph (, )][DBLP]
    
    
26. 
    A Simple BGN-Type Cryptosystem from LWE. [Citation Graph (, )][DBLP]
    
    
27. 
    Bonsai Trees, or How to Delegate a Lattice Basis. [Citation Graph (, )][DBLP]
    
    
28. 
    Efficient Lattice (H)IBE in the Standard Model. [Citation Graph (, )][DBLP]
    
    
29. 
    Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation. [Citation Graph (, )][DBLP]
    
    
30. 
    Stam's Collision Resistance Conjecture. [Citation Graph (, )][DBLP]
    
    
31. 
    Universal One-Way Hash Functions via Inaccessible Entropy. [Citation Graph (, )][DBLP]
    
    
32. 
    Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. [Citation Graph (, )][DBLP]
    
    
33. 
    Constructing Verifiable Random Functions with Large Input Spaces. [Citation Graph (, )][DBLP]
    
    
34. 
    Adaptive Trapdoor Functions and Chosen-Ciphertext Security. [Citation Graph (, )][DBLP]