Pages that link to "Item:Q3833627"
From MaRDI portal
The following pages link to The Knowledge Complexity of Interactive Proof Systems (Q3833627):
Displayed 50 items.
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- The reachability problem for finite cellular automata (Q674292) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol (Q802867) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority (Q809588) (← links)
- Relativized perfect zero knowledge is not BPP (Q811120) (← links)
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← 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)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- An interactive identification scheme based on discrete logarithms and factoring (Q1184505) (← links)
- Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- On being incoherent without being very hard (Q1198954) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- Graph isomorphism is low for PP (Q1210331) (← 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)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- Three systems for cryptographic protocol analysis (Q1330137) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- More on BPP and the polynomial-time hierarchy (Q1351599) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Fully parallelized multi-prover protocols for NEXP-time (Q1356878) (← links)
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- New efficient and secure protocols for verifiable signature sharing and other applications (Q1582011) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Randomized proofs in arithmetic (Q1807460) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- Robust threshold DSS signatures (Q1854399) (← links)