Hardware security without secure hardware: how to decrypt with a password and a server

DOI10.1016/j.tcs.2021.09.042OpenAlexW3203013693WikidataQ114657691 ScholiaQ114657691MaRDI QIDQ2664944

Ida Tucker, Céline Chevalier, Olivier Blazy, Patrick Towa, Laura Brouilhet, Damien Vergnaud

Publication date: 18 November 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.042

zbMATH Keywords

passwordcryptographyprovable securitypublic-key encryption

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust password-protected secret sharing
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Threshold password-authenticated key exchange
• Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions
• Virtual Smart Cards: How to Sign with a Password and a Server
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols
• An Algebraic Framework for Diffie-Hellman Assumptions
• Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment
• Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
• Malleable Proof Systems and Applications
• Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Structure-Preserving Smooth Projective Hashing
• Round-Optimal Password-Based Authenticated Key Exchange
• How to share a secret
• Secure Blind Decryption
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Keying Hash Functions for Message Authentication
• Cryptographic Extraction and Key Derivation: The HKDF Scheme
• Rerandomizable RCCA Encryption
• Universally Composable Password-Based Key Exchange
• Advances in Cryptology - CRYPTO 2003
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance

This page was built for publication: Hardware security without secure hardware: how to decrypt with a password and a server