Pages that link to "Item:Q3611789"
From MaRDI portal
The following pages link to Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (Q3611789):
Displayed 40 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- A communication-efficient private matching scheme in client-server model (Q726566) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Private set-intersection with common set-up (Q1783703) (← links)
- Quantum secure two-party computation for set intersection with rational players (Q1993844) (← links)
- Secure and efficient multiparty private set intersection cardinality (Q2025374) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- Server-aided private set intersection based on reputation (Q2293036) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- A secure scalar product protocol against malicious adversaries (Q2637306) (← links)
- Oblivious pseudorandom functions from isogenies (Q2692394) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function (Q2942846) (← links)
- Efficient Computations over Encrypted Data Blocks (Q2946399) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- Adaptive Oblivious Transfer and Generalization (Q2953778) (← links)
- New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness (Q2988351) (← links)
- Generic Fully Simulatable Adaptive Oblivious Transfer (Q3011306) (← links)
- Secure Set Intersection with Untrusted Hardware Tokens (Q3073691) (← links)
- Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy (Q3092348) (← links)
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (Q3194620) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Adaptive oblivious transfer with access control from lattice assumptions (Q5919120) (← links)
- Round-optimal oblivious transfer and MPC from computational CSIDH (Q6070767) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
- How to obfuscate MPC inputs (Q6114268) (← links)
- Practical and malicious private set intersection with improved efficiency (Q6122611) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
- Cryptanalysis of an oblivious PRF from supersingular isogenies (Q6157490) (← links)
- Linear-time 2-party secure merge from additively homomorphic encryption (Q6168324) (← links)
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model (Q6169456) (← links)