SPHF-Friendly Non-interactive Commitments

DOI10.1007/978-3-642-42033-7_12zbMath1327.94023OpenAlexW2151577209WikidataQ56921002 ScholiaQ56921002MaRDI QIDQ2867220

Michel Abdalla, David Pointcheval, Fabrice Benhamouda, Céline Chevalier, Olivier Blazy

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42033-7_12

zbMATH Keywords

password-authenticated key exchange (PAKE)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting ⋮ A New General Framework for Secure Public Key Encryption with Keyword Search ⋮ Private set intersection: new generic constructions and feasibility results ⋮ Beating the Birthday Paradox in Dining Cryptographer Networks ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ All-but-many encryption ⋮ Removing Erasures with Explainable Hash Proof Systems ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Fine-grained cryptography revisited ⋮ One-Round Strong Oblivious Signature-Based Envelope

This page was built for publication: SPHF-Friendly Non-interactive Commitments