Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs

DOI10.1007/978-3-662-46497-7_4zbMATH Open1379.94041OpenAlexW2110232583MaRDI QIDQ5261671FDOQ5261671

Authors: Carmit Hazay 

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

Recommendations

• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• An algebraic approach to maliciously secure private set intersection
• Oblivious Polynomial Evaluation
• Oblivious transfer and polynomial evaluation

zbMATH Keywords

committed oblivious PRFefficient secure computationoblivious polynomial evaluationsecure set-intersection

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (18)

• Scalable multi-party private set-intersection
• 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
• Multilinear pseudorandom functions
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Provably secure fair mutual private set intersection cardinality utilizing Bloom filter
• New realizations of efficient and secure private set intersection protocols preserving fairness
• 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
• Privately computing set-union and set-intersection cardinality via Bloom filters
• Bounded size-hiding private set intersection
• Efficient RSA key generation and threshold Paillier in the two-party setting
• 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 Q5261671)