Entity usage

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

1. A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra: Label: en
2. On Secure Multi-party Computation in Black-Box Groups: Label: en
3. Scalable and Unconditionally Secure Multiparty Computation: Label: en
4. Secure Hybrid Encryption from Weakened Key Encapsulation: Label: en
5. Deterministic and Efficiently Searchable Encryption: Label: en
6. Rerandomizable RCCA Encryption: Label: en
7. Chernoff-Type Direct Product Theorems: Label: en
8. A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness: Label: en
9. A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator: Label: en
10. Pirate Evolution: How to Make the Most of Your Traitor Keys: Label: en
11. Reducing Trust in the PKG in Identity Based Cryptosystems: Label: en
12. Invertible Universal Hashing and the TET Encryption Mode: Label: en
13. A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073: Label: en
14. Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach: Label: en
15. A Tight High-Order Entropic Quantum Uncertainty Relation with Applications: Label: en
16. Secure Identification and QKD in the Bounded-Quantum-Storage Model: Label: en
17. Cryptography in the Multi-string Model: Label: en
18. Simulatable VRFs with Applications to Multi-theorem NIZK: Label: en
19. How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?: Label: en
20. Amplifying Collision Resistance: A Complexity-Theoretic Treatment: Label: en
21. Hash Functions and the (Amplified) Boomerang Attack: Label: en
22. Security-Amplifying Combiners for Collision-Resistant Hash Functions: Label: en
23. Random Oracles and Auxiliary Input: Label: en
24. Domain Extension of Public Random Functions: Beyond the Birthday Barrier: Label: en
25. Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm: Label: en
26. A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU: Label: en
27. Indistinguishability Amplification: Label: en
28. Universally-Composable Two-Party Computation in Two Rounds: Label: en
29. Cryptography with Constant Input Locality: Label: en
30. Public Key Encryption That Allows PIR Queries: Label: en
31. How Should We Solve Search Problems Privately?: Label: en
32. Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5: Label: en
33. Practical Cryptanalysis of SFLASH: Label: en