244 results on '"Benny Applebaum"'
Search Results
2. Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC.
3. Conflict Checkable and Decodable Codes and Their Applications.
4. Stochastic Secret Sharing with $1$-Bit Shares and Applications to MPC.
5. Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography.
6. The Round Complexity of Statistical MPC with Optimal Resiliency.
7. Succinct Computational Secret Sharing.
8. Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead.
9. How to Recover a Secret with O(n) Additions.
10. Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
11. Distributing Keys and Random Secrets with Constant Complexity.
12. Secret Sharing, Slice Formulas, and Monotone Real Circuits.
13. Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract).
14. Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract).
15. Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications.
16. How to Recover a Secret with $O(n)$ Additions.
17. Conflict Checkable and Decodable Codes and Their Applications.
18. On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs.
19. On Actively-Secure Elementary MPC Reductions.
20. Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n.
21. The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
22. Better secret sharing via robust conditional disclosure of secrets.
23. Separating Two-Round Secure Computation From Oblivious Transfer.
24. The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract).
25. Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations.
26. Perfect Secure Computation in Two Rounds.
27. Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
28. Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.
29. Secret-Sharing Schemes for General and Uniform Access Structures.
30. Degree 2 is Complete for the Round-Complexity of Malicious MPC.
31. The Communication Complexity of Private Simultaneous Messages, Revisited.
32. On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate.
33. Correction: Locally Computable UOWHF with Linear Shrinkage.
34. Perfect Secure Computation in Two Rounds.
35. On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate.
36. The Communication Complexity of Private Simultaneous Messages, Revisited.
37. On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings.
38. Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$.
39. Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions.
40. Low-Complexity Cryptographic Hash Functions .
41. Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations.
42. Secure Arithmetic Computation with Constant Computational Overhead.
43. UTT: Decentralized Ecash with Accountable Privacy.
44. Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority.
45. Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels.
46. Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings.
47. Algebraic Attacks against Random Local Functions and Their Countermeasures.
48. Algebraic attacks against random local functions and their countermeasures.
49. Fast Pseudorandom Functions Based on Expander Graphs.
50. From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.