Removing Erasures with Explainable Hash Proof Systems

DOI10.1007/978-3-662-54365-8_7zbMath1383.94012DBLPconf/pkc/AbdallaBP17OpenAlexW4300257745WikidataQ56920940 ScholiaQ56920940MaRDI QIDQ5738786

Fabrice Benhamouda, David Pointcheval, Michel Abdalla

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

oblivious transfererasuresuniversal composabilitypassword authenticated key exchangeadaptive adversaries

Mathematics Subject Classification ID

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

Related Items (3)

Two-round adaptively secure multiparty computation from standard assumptions ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Removing Erasures with Explainable Hash Proof Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dual-System Simulation-Soundness with Applications to UC-PAKE and More
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols
• SPHF-Friendly Non-interactive Commitments
• Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
• Efficient Password Authenticated Key Exchange via Oblivious Transfer
• Round-Optimal Password-Based Authenticated Key Exchange
• Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Universally composable two-party and multi-party secure computation
• Universally Composable Security with Global Setup
• A Framework for Efficient and Composable Oblivious Transfer
• Optimal Randomness Extraction from a Diffie-Hellman Element
• Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
• Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
• How long does it take to catch a wild kangaroo?
• Non-committing Encryption from Φ-hiding
• Universally Composable Password-Based Key Exchange
• Secure Computation Without Authentication
• Removing Erasures with Explainable Hash Proof Systems

This page was built for publication: Removing Erasures with Explainable Hash Proof Systems