Pages that link to "Item:Q1324756"
From MaRDI portal
The following pages link to Definitions and properties of zero-knowledge proof systems (Q1324756):
Displaying 50 items.
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← 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)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Secure electronic bills of lading: Blind counts and digital signatures (Q609000) (← links)
- On sequential composition of precise zero-knowledge (Q615298) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- (Commit-and-prove) predictable arguments with privacy (Q2096627) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Formal verification of fair exchange based on Bitcoin smart contracts (Q2152024) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Verifiable functional encryption using Intel SGX (Q2697922) (← links)
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security (Q2802147) (← links)
- Practical Fault-Tolerant Data Aggregation (Q2822685) (← links)
