Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
From MaRDI portal
Publication:5261671
DOI10.1007/978-3-662-46497-7_4zbMath1379.94041OpenAlexW2110232583MaRDI QIDQ5261671
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
Related Items
Multilinear Pseudorandom Functions ⋮ Dynamic universal accumulator with batch update over bilinear groups ⋮ Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Private polynomial commitments and applications to MPC ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Finding one common item, privately ⋮ Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Quantum identity authentication scheme of vehicular ad-hoc networks ⋮ Quantum secure two-party computation for set intersection with rational players ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Scalable Multi-party Private Set-Intersection ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Private set-intersection with common set-up ⋮ Bounded Size-Hiding Private Set Intersection
This page was built for publication: Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
