Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
From MaRDI portal
Publication:2936611
DOI10.1007/978-3-662-45608-8_13zbMATH Open1311.94106OpenAlexW27238938MaRDI QIDQ2936611FDOQ2936611
Aggelos Kiayias, Hugo Krawczyk, Stanislaw Jarecki
Publication date: 6 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_13
Cited In (28)
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- A composable security treatment of ECVRF and batch verifications
- Password protected secret sharing from lattices
- Survey of information security
- A novel quantum dragonfly multi-key exchange protocol beyond conventional attacks
- Auditable asymmetric password authenticated public key establishment
- Removing the Strong RSA Assumption from Arguments over the Integers
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Provably Secure Scalable Distributed Authentication for Clouds
- Efficient and anonymous password-hardened encryption services
- \textsf{PERKS}: persistent and distributed key acquisition for secure storage from passwords
- Composable oblivious pseudo-random functions via garbled circuits
- Anonymous tokens with public metadata and applications to private contact tracing
- TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Security analysis of the WhatsApp end-to-end encrypted backup protocol
- A post-quantum round-optimal oblivious PRF from isogenies
- Oblivious accumulators
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- A fast and simple partially oblivious PRF, with applications
- A formal treatment of end-to-end encrypted cloud storage
- Oblivious issuance of proofs
- Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key
- Oblivious pseudorandom functions from isogenies
- UC-secure and Contributory Password-Authenticated Group Key Exchange
- How to obfuscate MPC inputs
- Anonymous tokens with private metadata bit
Recommendations
- Round-optimal password-based authenticated key exchange π π
- Round-optimal password-based authenticated key exchange π π
- Theory of Cryptography π π
- Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model π π
- A Rigorous Security Proof for the Enhanced Version of Password-Protected Secret Sharing Scheme π π
- TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF π π
- Password protected secret sharing from lattices π π
- Round-Efficient Anonymous Password-Authenticated Key Exchange Protocol in the Standard Model π π
- The round complexity of verifiable secret sharing and secure multicast π π
This page was built for publication: Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936611)