Entity usage

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

1. Smooth Projective Hashing for Conditionally Extractable Commitments: Label: en
2. Short and Stateless Signatures from the RSA Assumption: Label: en
3. The Group of Signed Quadratic Residues and Applications: Label: en
4. Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions: Label: en
5. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems: Label: en
6. On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem: Label: en
7. Utility Dependence in Correct and Fair Rational Secret Sharing: Label: en
8. Privacy-Enhancing Auctions Using Rational Cryptography: Label: en
9. Collusion-Free Multiparty Computation in the Mediated Model: Label: en
10. Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer: Label: en
11. The Round Complexity of Verifiable Secret Sharing Revisited: Label: en
12. Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field: Label: en
13. How Risky Is the Random-Oracle Model?: Label: en
14. Position Based Cryptography: Label: en
15. Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures: Label: en
16. Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle: Label: en
17. Improving the Security of Quantum Protocols via Commit-and-Open: Label: en
18. Computational Indistinguishability Amplification: Tight Product Theorems for System Composition: Label: en
19. Solving Hidden Number Problem with One Bit Oracle and Advice: Label: en
20. Batch Binary Edwards: Label: en
21. How to Hash into Elliptic Curves: Label: en
22. How to Encipher Messages on a Small Domain: Label: en
23. Message Authentication Codes from Unpredictable Block Ciphers: Label: en
24. Cryptanalysis of C2: Label: en
25. Distinguisher and Related-Key Attack on the Full AES-256: Label: en
26. New Birthday Attacks on Some MACs Based on Block Ciphers: Label: en
27. Linear Algebra with Sub-linear Zero-Knowledge Arguments: Label: en
28. On the Amortized Complexity of Zero-Knowledge Protocols: Label: en
29. On the Composition of Public-Coin Zero-Knowledge Protocols: Label: en
30. Probabilistically Checkable Arguments: Label: en
31. Computational Differential Privacy: Label: en
32. Randomizable Proofs and Delegatable Anonymous Credentials: Label: en
33. Private Mutual Authentication and Conditional Oblivious Transfer: Label: en
34. Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1: Label: en
35. Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate: Label: en
36. Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model: Label: en
37. Public-Key Cryptosystems Resilient to Key Leakage: Label: en
38. Reconstructing RSA Private Keys from Random Key Bits: Label: en