Theory of Cryptography

DOI10.1007/11681878MaRDI QIDQ5898641zbMATH OpenOpenAlexFDO

Authors Ivan B. Damgård, Nelly Fazio, Antonio R. Nicolosi

Publication date 12 February 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11681878

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Making Sigma-protocols non-interactive without random oracles
• New techniques for noninteractive zero-knowledge
• Non-interactive zero knowledge from sub-exponential DDH

Cited in

(27)

• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Compact designated verifier NIZKs from the CDH assumption without pairings
• New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Dual-mode NIZKs: possibility and impossibility results for property transfer
• One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
• Fully homomorphic NIZK and NIWI proofs
• Simultaneous amplification: the case of non-interactive zero-knowledge
• Reconciling non-malleability with homomorphic encryption
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Making Sigma-protocols non-interactive without random oracles
• scientific article; zbMATH DE number 6720551 (Why is no real title available?)
• Benaloh's dense probabilistic encryption revisited
• Simplified Submission of Inputs to Protocols
• Co-sound Zero-Knowledge with Public Keys
• Noninteractive Zero-Knowledge
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• Efficient confirmer signatures from the ``signature of a commitment paradigm
• Round-Optimal Blind Signatures from Waters Signatures
• Optimally sound sigma protocols under DCRA
• Multi-theorem preprocessing NIZKs from lattices
• Zero-knowledge arguments for subverted RSA groups
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
• Lattice-based group signatures in the standard model, revisited
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs

This page was built for publication: Theory of Cryptography

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