Pages that link to "Item:Q1108004"
From MaRDI portal
The following pages link to Does co-NP have short interactive proofs ? (Q1108004):
Displaying 50 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- The reachability problem for finite cellular automata (Q674292) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- On best-possible obfuscation (Q744349) (← 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)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- A note on the distribution of the distance from a lattice (Q1006407) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Probabilistic quantifiers and games (Q1112019) (← 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)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- Graph isomorphism is low for PP (Q1210331) (← 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)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Fully parallelized multi-prover protocols for NEXP-time (Q1356878) (← links)
- Solvable black-box group problems are low for PP (Q1390854) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- The counting complexity of group-definable languages (Q1575546) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- A one-round, two-prover, zero-knowledge protocol for NP (Q1894702) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- The complexity of local dimensions for constructible sets (Q1977150) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- How much randomness is needed to convert MA protocols to AM protocols? (Q2097236) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- New invariants for the graph isomorphism problem (Q2373963) (← links)
