Pages that link to "Item:Q4302852"
From MaRDI portal
The following pages link to Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852):
Displaying 50 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- Long-term security and universal composability (Q604632) (← links)
- On sequential composition of precise zero-knowledge (Q615298) (← links)
- A pure labeled transition semantics for the applied pi calculus (Q621583) (← links)
- Authentication schemes from actions on graphs, groups, or rings (Q638486) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- Privacy-preserving algorithms for distributed mining of frequent itemsets (Q867633) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- Quantum protocols for zero-knowledge systems (Q967279) (← links)
- Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms (Q999185) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← 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)
- Zero knowledge and the chromatic number (Q1276168) (← 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)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Inverting onto functions. (Q1426007) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- A black-box construction of non-malleable encryption from semantically secure encryption (Q1747662) (← links)
