Ad Hoc PSM Protocols: Secure Computation Without Coordination
From MaRDI portal
Publication:5270377
DOI10.1007/978-3-319-56617-7_20zbMath1415.94408OpenAlexW2953032017MaRDI QIDQ5270377
Yuval Ishai, Amos Beimel, Eyal Kushilevitz
Publication date: 23 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_20
Related Items (5)
Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions ⋮ Multi-party PSM, revisited: improved communication and unbalanced communication ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ Dynamic ad hoc clock synchronization ⋮ BETA: biometric-enabled threshold authentication
Cites Work
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
- Point-Function Obfuscation: A Framework and Generic Constructions
- Distribution Design
- A minimal model for secure computation (extended abstract)
- On Virtual Grey Box Obfuscation for General Circuits
- Non-Interactive Secure Multiparty Computation
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Secure Multiparty Computation with Minimal Interaction
- On Best-Possible Obfuscation
- Order-Preserving Symmetric Encryption
- Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
- Advances in Cryptology - EUROCRYPT 2004
- On the (im)possibility of obfuscating programs
- Multi-input Functional Encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
This page was built for publication: Ad Hoc PSM Protocols: Secure Computation Without Coordination