Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs

DOI10.1007/s00145-017-9263-yzbMath1444.94069OpenAlexW2745861814MaRDI QIDQ1753171

Carmit Hazay

Publication date: 28 May 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-017-9263-y

zbMATH Keywords

committed oblivious PRFefficient secure computationoblivious polynomial evaluationsecure set-intersection

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ A novel quantum private set intersection scheme with a semi-honest third party

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient set operations in the presence of malicious adversaries
• Efficient secure two-party protocols. Techniques and constructions
• Efficient robust private set intersection
• Security and composition of multiparty cryptographic protocols
• Oblivious polynomial evaluation and oblivious neural learning
• Oblivious transfer and polynomial evaluation
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
• Semi-homomorphic Encryption and Multiparty Computation
• Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
• Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
• (If) Size Matters: Size-Hiding Private Set Intersection
• Fast Secure Computation of Set Intersection
• Founding Cryptography on Oblivious Transfer – Efficiently
• LEGO for Two-Party Secure Computation
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Balanced Allocations
• Foundations of Cryptography
• Verifiable Delegation of Computation over Large Datasets
• The IPS Compiler: Optimizations, Variants and Concrete Efficiency
• Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Outsourced Pattern Matching
• Privacy-Preserving Set Operations
• Practical Two-Party Computation Based on the Conditional Gate
• Oblivious Polynomial Evaluation
• Public Key Cryptography - PKC 2005
• Theory of Cryptography
• Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
• More Robust Hashing: Cuckoo Hashing with a Stash
• Privacy preserving data mining
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

This page was built for publication: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs