Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection

DOI10.1007/978-3-319-52153-4_22zbMath1383.94036OpenAlexW2569238585MaRDI QIDQ2975818

Michele Orrù, Emmanuela Orsini, Peter Scholl

Publication date: 12 April 2017

Published in: Topics in Cryptology – CT-RSA 2017 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-52153-4_22

zbMATH Keywords

private set intersectionoblivious transfermulti-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

Oblivious key-value stores and amplification for private set intersection ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Private join and compute from PIR with default ⋮ Batching base oblivious transfers ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Improved Private Set Intersection Against Malicious Adversaries ⋮ Blazing fast OT for three-round UC OT extension ⋮ VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions ⋮ Multiparty generation of an RSA modulus ⋮ PSI from PaXoS: fast, malicious private set intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More efficient oblivious transfer extensions
• On the Complexity of Additively Homomorphic UC Commitments
• Oblivious transfer and polynomial evaluation
• Rate-1, Linear Time and Additively Homomorphic UC Commitments
• Improved OT Extension for Transferring Short Secrets
• BLAKE2: Simpler, Smaller, Fast as MD5
• Dishonest Majority Multi-Party Computation for Binary Circuits
• A New Approach to Practical Active-Secure Two-Party Computation
• The Simplest Protocol for Oblivious Transfer
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• Actively Secure OT Extension with Optimal Overhead
• A Framework for Efficient and Composable Oblivious Transfer
• Advances in Cryptology - CRYPTO 2003
• Alternative Protocols for Generalized Oblivious Transfer

This page was built for publication: Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection