Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
From MaRDI portal
Publication:5261671
DOI10.1007/978-3-662-46497-7_4zbMATH Open1379.94041OpenAlexW2110232583MaRDI QIDQ5261671FDOQ5261671
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_4
committed oblivious PRFefficient secure computationoblivious polynomial evaluationsecure set-intersection
Cited In (17)
- Finding one common item, privately
- Quantum secure two-party computation for set intersection with rational players
- Quantum identity authentication scheme of vehicular ad-hoc networks
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Private polynomial commitments and applications to MPC
- Secure and efficient multiparty private set intersection cardinality
- Dynamic universal accumulator with batch update over bilinear groups
- Private set-intersection with common set-up
- Information Security and Privacy
- Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter
- New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness
- Multilinear Pseudorandom Functions
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Scalable Multi-party Private Set-Intersection
- Bounded Size-Hiding Private Set Intersection
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
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 Q5261671)
