Secure Computation Without Authentication
From MaRDI portal
Publication:5451036
Recommendations
Cited in
(24)- Analysis of the Blockchain Protocol in Asynchronous Networks
- Generalized fuzzy password-authenticated key exchange from error correcting codes
- Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness
- GNUC: a new universal composability framework
- Player-centric Byzantine agreement
- Efficient constructions for almost-everywhere secure computation
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Contributory password-authenticated group key exchange with join capability
- Collusion-Free Protocols in the Mediated Model
- Secure computation on the web: computing without simultaneous interaction
- Structure-preserving smooth projective hashing
- Removing erasures with explainable hash proof systems
- Theory of Cryptography
- Impossibility results for universal composability in public-key models and with fixed inputs
- Cross-domain secure computation
- An efficient approach for secure multi-party computation without authenticated channel
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- UC-secure and contributory password-authenticated group key exchange
- Almost-everywhere secure computation with edge corruptions
- Interactive non-malleable codes
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Efficient algorithms for anonymous Byzantine agreement
- Secure computation without authentication
- scientific article; zbMATH DE number 2013820 (Why is no real title available?)
This page was built for publication: Secure Computation Without Authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451036)