Entity usage

Showing below up to 35 results in range #1 to #35.

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