Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
From MaRDI portal
Publication:3611789
DOI10.1007/978-3-642-00457-5_34zbMath1213.94113OpenAlexW1756608328MaRDI QIDQ3611789
Stanislaw Jarecki, Xiaomin Liu
Publication date: 3 March 2009
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_34
Related Items (40)
Efficient set intersection with simulation-based security ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ A secure scalar product protocol against malicious adversaries ⋮ Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters ⋮ A fast and simple partially oblivious PRF, with applications ⋮ Private set intersection: new generic constructions and feasibility results ⋮ A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function ⋮ Efficient Computations over Encrypted Data Blocks ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ How to obfuscate MPC inputs ⋮ Practical and malicious private set intersection with improved efficiency ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Cryptanalysis of an oblivious PRF from supersingular isogenies ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ ParaDiSE: efficient threshold authenticated encryption in fully malicious model ⋮ Oblivious pseudorandom functions from isogenies ⋮ Efficient set operations in the presence of malicious adversaries ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Generic Fully Simulatable Adaptive Oblivious Transfer ⋮ 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 ⋮ A communication-efficient private matching scheme in client-server model ⋮ Secure Set Intersection with Untrusted Hardware Tokens ⋮ Server-aided private set intersection based on reputation ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ PSI from PaXoS: fast, malicious private set intersection
This page was built for publication: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
