Removing erasures with explainable hash proof systems

DOI10.1007/978-3-662-54365-8_7MaRDI QIDQ5738786zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michel Abdalla, Fabrice Benhamouda, David Pointcheval

Publication date 13 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-662-54365-8_7

zbMATH Keywords

adaptive adversarieserasuresoblivious transferpassword authenticated key exchangeuniversal composability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Adaptively secure computation with partial erasures
• Structure-preserving smooth projective hashing
• Efficient password authenticated key exchange via oblivious transfer
• scientific article; zbMATH DE number 1256784
• scientific article; zbMATH DE number 1302802

Cites work

• A Framework for Efficient and Composable Oblivious Transfer
• Dual projective hashing and its applications -- lossy trapdoor functions and more
• Dual-system simulation-soundness with applications to UC-PAKE and more
• Efficient password authenticated key exchange via oblivious transfer
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• How long does it take to catch a wild kangaroo?
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1088227 (Why is no real title available?)
• scientific article; zbMATH DE number 1559560 (Why is no real title available?)
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Improved non-committing encryption with applications to adaptively secure protocols
• New techniques for SPHFs and efficient one-round PAKE protocols
• Non-committing encryption from -hiding
• Non-interactive and re-usable universally composable string commitments with adaptive security
• Optimal Randomness Extraction from a Diffie-Hellman Element
• Removing erasures with explainable hash proof systems
• Round-optimal password-based authenticated key exchange
• Secure Computation Without Authentication
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• SPHF-friendly non-interactive commitments
• Universally Composable Password-Based Key Exchange
• Universally Composable Security with Global Setup
• Universally composable two-party and multi-party secure computation

Cited in

(4)

• Two-round adaptively secure multiparty computation from standard assumptions
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Efficient Proofs of Secure Erasure
• Removing erasures with explainable hash proof systems

This page was built for publication: Removing erasures with explainable hash proof systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738786)