Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
136
views
39
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
819
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2021 : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part II
Oblivious Key-Value Stores and Amplification for Private Set Intersection
other
Author(s):
Gayathri Garimella
,
Benny Pinkas
,
Mike Rosulek
,
Ni Trieu
,
Avishay Yanai
Publication date
(Online):
August 11 2021
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Value-based Healthcare
Most cited references
39
Record
: found
Abstract
: not found
Article
: not found
THE USE OF CONFIDENCE OR FIDUCIAL LIMITS ILLUSTRATED IN THE CASE OF THE BINOMIAL
C. J. CLOPPER
,
E. PEARSON
(1934)
0
comments
Cited
823
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Probability and Computing
Michael Mitzenmacher
,
Eli Upfal
(2005)
0
comments
Cited
135
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Oblivious transfer and polynomial evaluation
Benny Pinkas
,
Moni Naor
(1999)
0
comments
Cited
53
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2021
Publication date (Online):
August 11 2021
Pages
: 395-425
DOI:
10.1007/978-3-030-84245-1_14
SO-VID:
14f5e8c7-d38a-4d03-92b3-95a1c9830fc8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
pp. 33
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
pp. 64
YOSO: You Only Speak Once
pp. 94
Fluid MPC: Secure Multiparty Computation with Dynamic Participants
pp. 124
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration
pp. 155
Broadcast-Optimal Two Round MPC with an Honest Majority
pp. 185
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
pp. 214
On the Round Complexity of Black-Box Secure MPC
pp. 244
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting
pp. 275
Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem
pp. 305
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions
pp. 335
Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings
pp. 365
Pushing the Limits of Valiant’s Universal Circuits: Simpler, Tighter and More Compact
pp. 395
Oblivious Key-Value Stores and Amplification for Private Set Intersection
pp. 426
MHz2k: MPC from HE over \(\mathbb {Z}_{2^k}\) with New Packing, Simpler Reshare, and Better ZKP
pp. 457
Sublinear GMW-Style Compiler for MPC with Preprocessing
pp. 486
Limits on the Adaptive Security of Yao’s Garbling
pp. 519
Subtractive Sets over Cyclotomic Rings
pp. 549
A Compressed \(\varSigma \)-Protocol Theory for Lattices
pp. 580
A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs
pp. 641
Deniable Fully Homomorphic Encryption from Learning with Errors
pp. 673
Counterexamples to New Circular Security Assumptions Underlying iO
pp. 701
How to Meet Ternary LWE Keys
pp. 732
Lattice Reduction with Approximate Enumeration Oracles
pp. 760
Towards Faster Polynomial-Time Lattice Reduction
pp. 791
Lower Bounds on Lattice Sieving and Information Set Decoding
Similar content
819
More efficient oblivious transfer and extensions for faster secure computation
Authors:
G Asharov
,
Y Lindell
,
T SCHNEIDER
…
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Authors:
Severin Winkler
,
Jürg Wullschleger
Spacetime-constrained oblivious transfer
Authors:
Damián Pitalúa-García
See all similar
Cited by
1
Concretely efficient secure multi-party computation protocols: survey and more
Authors:
Dengguo Feng
,
Kang Yang
See all cited by