Pages that link to "Item:Q1110348"
From MaRDI portal
The following pages link to Minimum disclosure proofs of knowledge (Q1110348):
Displayed 22 items.
- A language-dependent cryptographic primitive (Q676829) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Bit commitment using pseudorandomness (Q808241) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Elliptic curve implementation of zero-knowledge blobs (Q1180510) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- On hiding information from an oracle (Q1263281) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Signcryption with non-interactive non-repudiation (Q2572979) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)