How to obfuscate MPC inputs
From MaRDI portal
Publication:6114268
DOI10.1007/978-3-031-22365-5_6zbMath1519.94173OpenAlexW4312629901MaRDI QIDQ6114268
Ian McQuoid, Jiayu Xu, Mike Rosulek
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_6
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Cites Work
- Unnamed Item
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Non-interactive multiparty computation without correlated randomness
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Separating symmetric and asymmetric password-authenticated key exchange
- New techniques for obfuscating conjunctions
- Obfuscating Conjunctions
- Non-Interactive Secure Multiparty Computation
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Obfuscation of Hyperplane Membership
- On obfuscating point functions
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Advances in Cryptology - EUROCRYPT 2004
- Obfuscating Point Functions with Multibit Output
- On the Equivalence of Generic Group Models
- Theory of Cryptography
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- A Method for Making Password-Based Key Exchange Resilient to Server Compromise
- Cryptography and Coding
This page was built for publication: How to obfuscate MPC inputs