Pages that link to "Item:Q4365519"
From MaRDI portal
The following pages link to The knowledge complexity of interactive proof-systems (Q4365519):
Displayed 41 items.
- Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896) (← links)
- On the power of interaction (Q751809) (← links)
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- Relativized perfect zero knowledge is not BPP (Q811120) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- On the design of cryptographic primitives (Q850775) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A? (Q912625) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Belief, awareness, and limited reasoning (Q1096610) (← links)
- Partitioned encryption and achieving simultaneity by partitioning (Q1099131) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Zero-knowledge proofs of identity (Q1112785) (← links)
- Graph isomorphism is in the low hierarchy (Q1116696) (← links)
- Relativized Arthur-Merlin versus Merlin-Arthur games (Q1117218) (← links)
- Are there interactive protocols for co-NP languages? (Q1118406) (← links)
- Efficient signature generation by smart cards (Q1180508) (← links)
- On games of incomplete information (Q1199525) (← links)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
- The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
- Round-optimal perfect zero-knowledge proofs (Q1322120) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- Dynamic sizing of multilayer perceptrons (Q1328141) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- Improved identification schemes based on error-correcting codes (Q1352426) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- Probabilistic game automata (Q1824400) (← links)
- Proving properties of interactive proofs by a generalized counting technique (Q1825663) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Survey of information security (Q2385398) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- Entity authentication schemes using braid word reduction (Q2489938) (← links)
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic (Q2500832) (← links)
- Security analysis of discrete logarithm based cryptosystems (Q3443271) (← links)
- Generalized lowness and highness and probabilistic complexity classes (Q4729352) (← links)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge (Q5458611) (← links)