Ad hoc PSM protocols: secure computation without coordination
From MaRDI portal
Recommendations
- The complexity of multiparty PSM protocols and related models
- Multi-party PSM, revisited: improved communication and unbalanced communication
- scientific article; zbMATH DE number 1256784
- The communication complexity of private simultaneous messages, revisited
- Non-interactive secure multiparty computation
Cites work
- A minimal model for secure computation (extended abstract)
- Advances in Cryptology - EUROCRYPT 2004
- Distribution design
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multi-input functional encryption
- Non-interactive secure multiparty computation
- On Best-Possible Obfuscation
- On the (im)possibility of obfuscating programs
- On virtual grey box obfuscation for general circuits
- Order-Preserving Symmetric Encryption
- Order-preserving encryption revisited: improved security analysis and alternative solutions
- Point-function obfuscation: a framework and generic constructions
- Secure multiparty computation with minimal interaction
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
Cited in
(7)- Timed secret sharing
- Threshold garbled circuits and ad hoc secure computation
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
- Dynamic ad hoc clock synchronization
- BETA: biometric-enabled threshold authentication
- Multi-party PSM, revisited: improved communication and unbalanced communication
- Efficient multiparty private simultaneous messages for symmetric functions
This page was built for publication: Ad hoc PSM protocols: secure computation without coordination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270377)
