Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
type: Item
instance of: scholarly article
title: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
zbMATH Open document ID: 1444.94069
author: Carmit Hazay
published in: Journal of Cryptology
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6875423
zbMATH Keywords: efficient secure computation
zbMATH Keywords: oblivious polynomial evaluation
zbMATH Keywords: secure set-intersection
zbMATH Keywords: committed oblivious PRF
MaRDI profile type: Publication
full work available at URL: s00145-017-9263-y
OpenAlex ID: W2745861814
cites work: Balanced Allocations
cites work: (If) Size Matters: Size-Hiding Private Set Intersection
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Q4035733
cites work: Verifiable Delegation of Computation over Large Datasets
cites work: Security and composition of multiparty cryptographic protocols
cites work: Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
cites work: Oblivious polynomial evaluation and oblivious neural learning
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Efficient robust private set intersection
cites work: Public Key Cryptography - PKC 2005
cites work: Outsourced Pattern Matching
cites work: Theory of Cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Q4941851
cites work: Foundations of Cryptography
cites work: Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
cites work: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
cites work: Efficient secure two-party protocols. Techniques and constructions
cites work: Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
cites work: Efficient set operations in the presence of malicious adversaries
cites work: Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
cites work: Fast Secure Computation of Set Intersection
cites work: More Robust Hashing: Cuckoo Hashing with a Stash
cites work: Privacy-Preserving Set Operations
cites work: Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
cites work: The IPS Compiler: Optimizations, Variants and Concrete Efficiency
cites work: Privacy preserving data mining
cites work: Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: LEGO for Two-Party Secure Computation
cites work: Oblivious transfer and polynomial evaluation
cites work: Oblivious Polynomial Evaluation
cites work: Q4318686
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Q3210171
cites work: Practical Two-Party Computation Based on the Conditional Gate
cites work: Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
cites work: Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
DOI: 10.1007/S00145-017-9263-Y
Recommended article: Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
Recommended article: Information Security and Privacy
Recommended article: Oblivious transfer and polynomial evaluation
Recommended article: Polynomial representation is tricky: maliciously secure private set intersection revisited
Recommended article: An algebraic approach to maliciously secure private set intersection
Recommended article: An Efficient and Provably Secure Private Polynomial Evaluation Scheme
Recommended article: Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
Recommended article: Unconditionally secure distributed oblivious polynomial evaluation
Recommended article: Verifiable private polynomial evaluation
Recommended article: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
description: scientific article; zbMATH DE number 6875423