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.
- Quantum computation vs. firewalls (Q303315) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality (Q320197) (← links)
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. (Q398324) (← links)
- Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Certifying algorithms (Q465678) (← links)
- Several cryptographic applications of \(\Sigma\)-protocol (Q473026) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
- A code-based group signature scheme (Q510499) (← links)
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Secure electronic bills of lading: Blind counts and digital signatures (Q609000) (← links)
- Precise zero-knowledge arguments with poly-logarithmic efficiency (Q615245) (← links)
- On sequential composition of precise zero-knowledge (Q615298) (← links)
- Zero-knowledge identification scheme based on Weil pairing (Q639425) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Secure computation without authentication (Q656923) (← links)
- 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)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← 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)
- Quantum information and the PCP theorem (Q835644) (← links)
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
- Zero-knowledge proofs of knowledge for group homomorphisms (Q887447) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← 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)
- SZK proofs for black-box group problems (Q929290) (← links)