Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
From MaRDI portal
Publication:3392944
Recommendations
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Automata, Languages and Programming
- On round-optimal zero knowledge in the bare public-key model
- 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 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (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?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1418313 (Why is no real title available?)
- scientific article; zbMATH DE number 1440055 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Automata, Languages and Programming
- Bit commitment using pseudorandomness
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Efficient Zero Knowledge on the Internet
- Efficient concurrent zero-knowledge in the auxiliary string model
- Efficient signature generation by smart cards
- Foundations of Cryptography
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
- How to construct constant-round zero-knowledge proof systems for NP
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- New and improved constructions of non-malleable cryptographic protocols
- Nonmalleable Cryptography
- Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
- Resettable zero-knowledge (extended abstract)
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
Cited in
(9)- A black-box construction of non-malleable encryption from semantically secure encryption
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Impossibility results for universal composability in public-key models and with fixed inputs
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Automata, Languages and Programming
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
This page was built for publication: Concurrently Non-malleable Black-Box 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 Q3392944)
