Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
From MaRDI portal
Publication:2891478
DOI10.1007/978-3-642-28914-9_6zbMath1303.94069OpenAlexW1863464715WikidataQ56921051 ScholiaQ56921051MaRDI QIDQ2891478
Olivier Blazy, David Pointcheval, Damien Vergnaud
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_6
Related Items (11)
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting ⋮ A New General Framework for Secure Public Key Encryption with Keyword Search ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions ⋮ Cryptographic group actions and applications ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages ⋮ One-Round Strong Oblivious Signature-Based Envelope ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
This page was built for publication: Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
