scientific article; zbMATH DE number 4053065
From MaRDI portal
Publication:3789104
Recommendations
Cited in
(68)- Simple zero-knowledge proof of knowing \(\sqrt{X_1}\) or \(\sqrt{X_2}\) mod \(N\)
- Zero-knowledge proofs of identity
- A uniform-complexity treatment of encryption and zero-knowledge
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- Definitions and properties of zero-knowledge proof systems
- The knowledge complexity of quadratic residuosity languages
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Short non-interactive cryptographic proofs
- Confidential and efficient asset proof for bitcoin exchanges
- Zero-knowledge arguments and public-key cryptography
- A low communication competitive interactive proof system for promised quadratic residuosity
- How to construct constant-round zero-knowledge proof systems for NP
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Statistical Zaps and new oblivious transfer protocols
- Non-interactive zero knowledge from sub-exponential DDH
- Unlinkable and invisible \(\gamma \)-sanitizable signatures
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- Survey of information security
- scientific article; zbMATH DE number 1583796 (Why is no real title available?)
- 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
- Short discreet proofs
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- On the Portability of Generalized Schnorr Proofs
- Zero-Knowledge Simulation of Boolean Circuits
- The Knowledge Complexity of Interactive Proof Systems
- Noninteractive Zero-Knowledge
- scientific article; zbMATH DE number 94166 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- Broadcast Interactive Proofs
- Removing Interaction from Zero-Knowledge Proofs
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
- Interactive Proofs with Provable Security against Honest Verifiers
- How to Utilize the Randomness of Zero-Knowledge Proofs
- scientific article; zbMATH DE number 503349 (Why is no real title available?)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 708824 (Why is no real title available?)
- scientific article; zbMATH DE number 1024047 (Why is no real title available?)
- The knowledge complexity of interactive proof-systems
- scientific article; zbMATH DE number 1759323 (Why is no real title available?)
- On characterizations of escrow encryption schemes
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
- Super-Perfect Zero-Knowledge Proofs
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- Zero Knowledge and Soundness Are Symmetric
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Security in Communication Networks
- Theory of Cryptography
- Information Security and Cryptology
- Information Security and Cryptology
- Theory of Cryptography
- Multi-theorem preprocessing NIZKs from lattices
- Explainable arguments
- A generic transform from multi-round interactive proof to NIZK
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- A note on non-interactive zero-knowledge from CDH
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
- Non-interactive zero-knowledge from LPN and MQ
- How to share an NP statement or combiners for zero-knowledge proofs
- Black-box non-interactive zero knowledge from vector trapdoor hash
- Non-interactive zero-knowledge proofs for composite statements
- Constant-round perfect zero-knowledge computationally convincing protocols
- A discrete logarithm implementation of perfect zero-knowledge blobs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789104)
