Recycling random bits in composed perfect zero-knowledge

DOI10.1007/3-540-49264-X_30MaRDI QIDQ2757259zbMATH OpenFDO

Authors Giovanni Di Crescenzo

Publication date 25 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-49264-X_30

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1263222
• Randomness-efficient non-interactive zero knowledge
• On sequential composition of precise zero-knowledge
• Resettable zero-knowledge (extended abstract)
• scientific article; zbMATH DE number 1284001
• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Zero knowledge in the random oracle model, revisited
• On the number of random bits in totally private computation
• Randomness re-use in multi-recipient encryption schemes
• Resettably-sound resettable zero knowledge in constant rounds

Cited in

(5)

• Parallelism of the finite-time dynamics method based on GPU
• Randomness-efficient non-interactive zero knowledge
• On server trust in private proxy auctions
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
• Locally random reductions: Improvements and applications

This page was built for publication: Recycling random bits in composed perfect zero-knowledge

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