553 results on '"Malkin, Tal"'
Search Results
2. Topology-Hiding Communication from Minimal Assumptions
3. Lower Bounds for Oblivious Near-Neighbor Search
4. Two Party Distribution Testing: Communication and Security
5. Poly Onions: Achieving Anonymity in the Presence of Churn
6. XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE
7. Unclonable Polymers and Their Cryptographic Applications
8. Non-Malleable Codes for Small-Depth Circuits
9. Topology-Hiding Communication from Minimal Assumptions
10. Non-malleability Against Polynomial Tampering
11. Strong Hardness of Privacy from Weak Traitor Tracing
12. Poly Onions: Achieving Anonymity in the Presence of Churn
13. XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE
14. Unclonable Polymers and Their Cryptographic Applications
15. Is Information-Theoretic Topology-Hiding Computation Possible?
16. Public-Key Function-Private Hidden Vector Encryption (and More)
17. Non-Malleable Codes Against Bounded Polynomial Time Tampering
18. Mitigating the One-Use Restriction in Attribute-Based Encryption
19. Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation
20. Hardness of Non-interactive Differential Privacy from One-Way Functions
21. A Simple Obfuscation Scheme for Pattern-Matching with Wildcards
22. Non-malleable Codes from Average-Case Hardness: , Decision Trees, and Streaming Space-Bounded Tampering
23. Exploring the Boundaries of Topology-Hiding Computation
24. Lower Bounds for Oblivious Near-Neighbor Search
25. Non-malleability Against Polynomial Tampering
26. Topology-Hiding Communication from Minimal Assumptions
27. Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
28. Non-Malleable Codes Against Bounded Polynomial Time Tampering
29. Is Information-Theoretic Topology-Hiding Computation Possible?
30. The Power of Negations in Cryptography
31. Improved, black-box, non-malleable encryption from semantic security
32. A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption
33. Efficient distributed 1 out of n oblivious transfer
34. A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication
35. Order-Preserving Encryption Secure Beyond One-Wayness
36. Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
37. Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$, Decision Trees, and Streaming Space-Bounded Tampering
38. Exploring the Boundaries of Topology-Hiding Computation
39. Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
40. Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction
41. Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time
42. Computational Extractors and Pseudorandomness
43. Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
44. BiTR: Built-in Tamper Resilience
45. Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications
46. Efficient Circuit-Size Independent Public Key Encryption with KDM Security
47. On the Black-Box Complexity of Optimally-Fair Coin Tossing
48. Signatures Resilient to Continual Leakage on Memory and Computation
49. Secure Multi-party Computation Minimizing Online Rounds
50. Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.