466 results on '"Rosulek A"'
Search Results
52. Verifiable Distributed Aggregation Functions
53. PSI from PaXoS: Fast, Malicious Private Set Intersection
54. Improvements for Gate-Hiding Garbled Circuits.
55. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques.
56. Approximate Thumbnail Preserving Encryption.
57. Malicious-Secure Private Set Intersection via Dual Execution.
58. DUPLO: Unifying Cut-and-Choose for Garbled Circuits.
59. Non-interactive Secure 2PC in the Offline/Online and Batch Settings.
60. Sublinear Zero-Knowledge Arguments for RAM Programs.
61. Improved Private Set Intersection Against Malicious Adversaries.
62. Improvements for Gate-Hiding Garbled Circuits
63. Sublinear Zero-Knowledge Arguments for RAM Programs
64. Improved Private Set Intersection Against Malicious Adversaries
65. Non-interactive Secure 2PC in the Offline/Online and Batch Settings
66. Contemporary Referendum on Independence (RI) and Linguistic Aspects of an Intelligible Referendum Question (RQ)
67. Balancing Image Privacy and Usability with Thumbnail-Preserving Encryption.
68. PIR-PSI: Scaling Private Contact Discovery.
69. A Pragmatic Introduction to Secure Multi-Party Computation.
70. Faster Malicious 2-Party Secure Computation with Online/Offline Dual Execution.
71. Efficient Batched Oblivious PRF with Applications to Private Set Intersection.
72. Garbling Gadgets for Boolean and Arithmetic Circuits.
73. Linicrypt: A Model for Practical Cryptography.
74. Linicrypt: A Model for Practical Cryptography
75. Coordination and redox state–dependent structural changes of the heme-based oxygen sensor AfGcHK associated with intraprotein signal transduction
76. Characterizing Collision and Second-Preimage Resistance in Linicrypt
77. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
78. Reconciling Non-malleability with Homomorphic Encryption.
79. Richer Efficiency/Security Trade-offs in 2PC.
80. Vamonos: Embeddable visualizations of advanced algorithms.
81. Fast and Secure Three-party Computation: The Garbled Circuit Approach.
82. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates.
83. How to Efficiently Evaluate RAM Programs with Malicious Security.
84. Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost.
85. Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
86. Two Halves Make a Whole : Reducing Data Transfer in Garbled Circuits Using Half Gates
87. How to Efficiently Evaluate RAM Programs with Malicious Security
88. Richer Efficiency/Security Trade-offs in 2PC
89. One Round Threshold ECDSA Without Roll Call
90. FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR.
91. FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
92. SWiM: Secure Wildcard Pattern Matching from OT Extension
93. On the Structure of Unconditional UC Hybrid Protocols
94. Mapping protein structural changes by quantitative cross-linking
95. Reconciling Non-malleability with Homomorphic Encryption
96. Sounds good: Phonetic sound patterns in top brand names
97. Secure Your Data and Compute on It, Too.
98. Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities.
99. Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction.
100. Complexity of Multi-Party Computation Functionalities.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.