77 results on '"VAIKUNTANATHAN, VINOD"'
Search Results
2. Adaptively Sound Zero-Knowledge SNARKs for UP
3. How to Construct Quantum FHE, Generically
4. SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption
5. Revocable Cryptography from Learning with Errors
6. Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers
7. SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption
8. SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption
9. Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers
10. Revocable Cryptography from Learning with Errors
11. Witness Encryption and Null-IO from Evasive LWE
12. Locally Verifiable Signature and Key Aggregation
13. Succinct Classical Verification of Quantum Computation
14. Witness Encryption and Null-IO from Evasive LWE
15. Succinct Classical Verification of Quantum Computation
16. Locally Verifiable Signature and Key Aggregation
17. On the Optimal Communication Complexity of Error-Correcting Multi-server PIR
18. Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions
19. The Price of Verifiability: Lower Bounds for Verifiable Random Functions
20. Beyond Uber: Instantiating Generic Groups via PGGs
21. One-Time Programs from Commodity Hardware
22. Permissionless Clock Synchronization with Public Setup
23. Universal Reductions: Reductions Relative to Stateful Oracles
24. How to Sample a Discrete Gaussian (and more) from a Random Oracle
25. Random-Index Oblivious RAM
26. Parallelizable Delegation from LWE
27. Verifiable Private Information Retrieval
28. On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness
29. Poly Onions: Achieving Anonymity in the Presence of Churn
30. Bet-or-Pass: Adversarially Robust Bloom Filters
31. Public-Key Encryption from Homogeneous CLWE
32. Anonymous Whistleblowing over Authenticated Channels
33. PPAD is as Hard as LWE and Iterated Squaring
34. SCALES : MPC with Small Clients and Larger Ephemeral Servers
35. Fully-Secure MPC with Minimal Trust
36. Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT
37. Secure Non-interactive Reducibility is Decidable
38. A Tight Computational Indistinguishability Bound for Product Distributions
39. Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security : (Extended Abstract)
40. Adaptive Multiparty NIKE
41. Secure Sampling with Sublinear Communication
42. Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
43. Secure Non-interactive Simulation from Arbitrary Joint Distributions
44. On the Worst-Case Inefficiency of CGKA
45. On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups
46. How to Obfuscate MPC Inputs
47. Statistical Security in Two-Party Computation Revisited
48. Multi-Input Quadratic Functional Encryption: Stronger Security, Broader Functionality
49. Sublinear Secure Computation from New Assumptions
50. Bounded Functional Encryption for Turing Machines: Adaptive Security from General Assumptions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.