Theory of Cryptography

DOI10.1007/11681878zbMath1112.94007OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898641

Nelly Fazio, Ivan B. Damgård, 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)

Related Items (17)

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 ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Simplified Submission of Inputs to Protocols ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ 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 ⋮ Co-sound Zero-Knowledge with Public Keys ⋮ Round-Optimal Blind Signatures from Waters Signatures ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: Theory of Cryptography