Disjunctions for Hash Proof Systems: New Constructions and Applications

DOI10.1007/978-3-662-46803-6_3zbMath1326.94065OpenAlexW2163542231WikidataQ56920953 ScholiaQ56920953MaRDI QIDQ2948379

David Pointcheval, Fabrice Benhamouda, Michel Abdalla

Publication date: 30 September 2015

Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_3

zbMATH Keywords

linearly homomorphic signaturehash proof systemnon-interactive zero-knowledge proofthreshold encryptiongroup password authenticated key exchangestructure preserving primitive

Mathematics Subject Classification ID

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

Related Items (23)

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ On QA-NIZK in the BPK Model ⋮ Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ Verifier-based anonymous password-authenticated key exchange protocol in the standard model ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ QANIZK for adversary-dependent languages and their applications ⋮ Identity-based encryption in DDH hard groups ⋮ Chosen ciphertext secure keyed two-level homomorphic encryption ⋮ Witness encryption from smooth projective hashing system ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions ⋮ Efficient NIZKs for algebraic sets ⋮ Smooth zero-knowledge hash functions ⋮ Shorter quasi-adaptive NIZK proofs for linear subspaces ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems ⋮ Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs ⋮ One-Round Strong Oblivious Signature-Based Envelope ⋮ Public key encryption with equality test via hash proof system ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ Adaptive Partitioning

This page was built for publication: Disjunctions for Hash Proof Systems: New Constructions and Applications