69 results on '"Rosulek A"'
Search Results
2. Malicious Secure, Structure-Aware Private Set Intersection
3. Finding One Common Item, Privately
4. How to Obfuscate MPC Inputs
5. Structure-Aware Private Set Intersection, with Applications to Fuzzy Matching
6. Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits
7. Batching Base Oblivious Transfers
8. Oblivious Key-Value Stores and Amplification for Private Set Intersection
9. Private Set Operations from Oblivious Switching
10. PSI from PaXoS: Fast, Malicious Private Set Intersection
11. Characterizing Collision and Second-Preimage Resistance in Linicrypt
12. Scalable Private Set Union from Symmetric-Key Techniques
13. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
14. SWiM: Secure Wildcard Pattern Matching from OT Extension
15. Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
16. On the Structure of Unconditional UC Hybrid Protocols
17. Complexity of Multi-Party Computation Functionalities.
18. Sublinear Zero-Knowledge Arguments for RAM Programs
19. Non-interactive Secure 2PC in the Offline/Online and Batch Settings
20. Improved Private Set Intersection Against Malicious Adversaries
21. Improvements for Gate-Hiding Garbled Circuits
22. Linicrypt: A Model for Practical Cryptography
23. Introduction
24. The Theoretical Framework
25. The Big Picture
26. The Lawyers
27. The Victims
28. The Jurors
29. The Defendants
30. Richer Efficiency/Security Trade-offs in 2PC
31. Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
32. Two Halves Make a Whole
33. How to Efficiently Evaluate RAM Programs with Malicious Security
34. FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
35. Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
36. Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction
37. Must You Know the Code of f to Securely Compute f?
38. A Unified Characterization of Completeness and Triviality for Secure Function Evaluation
39. Universal Composability from Essentially Any Trusted Setup
40. Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
41. Attribute-Based Signatures
42. A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
43. Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
44. Design and Implementation of Textile Sensors for Biotelemetry Applications
45. Towards Robust Computation on Encrypted Data
46. Linicrypt: A Model for Practical Cryptography.
47. Homomorphic Encryption with CCA Security
48. Prosecution and defense closing speeches
49. Sensitivity Analysis in Sensor HomeCare Implementation
50. Rerandomizable RCCA Encryption
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.