Pages that link to "Item:Q3833627"
From MaRDI portal
The following pages link to The Knowledge Complexity of Interactive Proof Systems (Q3833627):
Displaying 8 items.
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Secure sealed-bid online auctions using discreet cryptographic proofs (Q2450498) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
