Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model

DOI10.1007/978-3-540-70583-3_45MaRDI QIDQ3519532zbMATH OpenOpenAlexFDO

Authors Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_45

zbMATH Keywords

witness indistinguishabilitynon-malleable zero knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Automata, Languages and Programming
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• On constant-round concurrent non-malleable proof systems
• Concurrent non-malleable zero knowledge proofs

Cites work

• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• scientific article; zbMATH DE number 1842510 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Automata, Languages and Programming
• Efficient Zero Knowledge on the Internet
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• New and improved constructions of non-malleable cryptographic protocols
• Nonmalleable Cryptography
• Resettable zero-knowledge (extended abstract)

Cited in

(16)

• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Concurrent knowledge extraction in public-key models
• Concurrent non-malleable commitments (and more) in 3 rounds
• Concurrent knowledge extraction in the public-key model
• Concurrent non-malleable zero knowledge proofs
• Impossibility of black-box simulation against leakage attacks
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• On the necessary and sufficient assumptions for UC computation
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• Automata, Languages and Programming
• Expedient Non-malleability Notions for Hash Functions
• On constant-round concurrent non-malleable proof systems
• On constant-round concurrent zero-knowledge from a knowledge assumption
• On Constant-Round Concurrent Zero-Knowledge
• Co-sound Zero-Knowledge with Public Keys
• Non-malleable functions and their applications

This page was built for publication: Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model

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