Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
From MaRDI portal
Recommendations
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Information Security and Privacy
- Oblivious transfer and polynomial evaluation
- Polynomial representation is tricky: maliciously secure private set intersection revisited
- An algebraic approach to maliciously secure private set intersection
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Augmented oblivious polynomial evaluation protocol and its applications
- Unconditionally secure distributed oblivious polynomial evaluation
- Verifiable private polynomial evaluation
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1418291 (Why is no real title available?)
- (If) size matters: size-hiding private set intersection
- A new approach to practical active-secure two-party computation
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Augmented oblivious polynomial evaluation protocol and its applications
- Balanced Allocations
- Computationally secure pattern matching in the presence of malicious adversaries
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient robust private set intersection
- Efficient secure two-party protocols. Techniques and constructions
- Efficient set operations in the presence of malicious adversaries
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Fast secure computation of set intersection
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- LEGO for Two-Party Secure Computation
- Linear-complexity private set intersection protocols secure in malicious model
- More Robust Hashing: Cuckoo Hashing with a Stash
- Multiparty Computation from Somewhat Homomorphic Encryption
- Oblivious Polynomial Evaluation
- Oblivious polynomial evaluation and oblivious neural learning
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Oblivious transfer and polynomial evaluation
- Outsourced pattern matching
- Practical Two-Party Computation Based on the Conditional Gate
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Privacy preserving data mining
- Privacy-Preserving Set Operations
- Public Key Cryptography - PKC 2005
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure two-party computation via cut-and-choose oblivious transfer
- Security and composition of multiparty cryptographic protocols
- Semi-homomorphic encryption and multiparty computation
- The IPS compiler: optimizations, variants and concrete efficiency
- Theory of Cryptography
- Verifiable delegation of computation over large datasets
Cited in
(8)- A novel quantum private set intersection scheme with a semi-honest third party
- Algebraic (Trapdoor) one-way functions and their applications
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- 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
- Information Security and Privacy
- Public Key Cryptography - PKC 2006
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
This page was built for publication: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753171)
