Disjunctions for Hash Proof Systems: New Constructions and Applications

DOI10.1007/978-3-662-46803-6_3MaRDI QIDQ2948379zbMATH OpenOpenAlexWikidataFDO

Authors Michel Abdalla, Fabrice Benhamouda, David Pointcheval

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

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

Recommendations

• Hash proof systems over lattices revisited
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Updatable hash proof system and its applications
• scientific article; zbMATH DE number 177052
• Designated verifier proofs and their applications
• Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
• A new interactive hashing theorem
• On fast verification of hash chains
• Threshold and revocation cryptosystems via extractable hash proofs
• A new non-Merkle-Damgård structural hash function with provable security

Cited in

(29)

• Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
• A gapless code-based hash proof system based on RQC and its applications
• Cryptanalysis of the CLT13 multilinear map
• Public key encryption with equality test via hash proof system
• CCA-secure inner-product functional encryption from projective hash functions
• Hash proof systems over lattices revisited
• Witness encryption from smooth projective hashing system
• Smooth zero-knowledge hash functions
• One-round strong oblivious signature-based envelope
• Almost optimal oblivious transfer from QA-NIZK
• On QA-NIZK in the BPK model
• Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
• Efficient NIZKs for algebraic sets
• Adaptive partitioning
• Identity-based encryption in DDH hard groups
• Verifier-based anonymous password-authenticated key exchange protocol in the standard model
• Witness encryption for succinct functional commitments and applications
• Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
• On witness encryption and laconic zero-knowledge arguments
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Cryptographic reverse firewall via malleable smooth projective hash functions
• Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption
• Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
• CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption
• Chosen ciphertext secure keyed two-level homomorphic encryption
• Rate-1 incompressible encryption from standard assumptions
• QANIZK for adversary-dependent languages and their applications
• On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
• Equivalences and black-box separations of matrix Diffie-Hellman problems

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

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