Pages that link to "Item:Q1110348"
From MaRDI portal
The following pages link to Minimum disclosure proofs of knowledge (Q1110348):
Displaying 50 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- On the impossibility of non-static quantum bit commitment between two parties (Q424242) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Short undeniable signatures based on group homomorphisms (Q451120) (← links)
- New receipt-free voting scheme using double-trapdoor commitment (Q543836) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Precise zero-knowledge arguments with poly-logarithmic efficiency (Q615245) (← links)
- On sequential composition of precise zero-knowledge (Q615298) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Identity-based trapdoor mercurial commitments and applications (Q719291) (← links)
- Verifiable disclosure (Q722620) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Bit commitment using pseudorandomness (Q808241) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← 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)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Elliptic curve implementation of zero-knowledge blobs (Q1180510) (← 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)
- On hiding information from an oracle (Q1263281) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Threshold ring signatures: new definitions and post-quantum security (Q2055701) (← links)
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← links)
- Group encryption: full dynamicity, message filtering and code-based instantiation (Q2061981) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Online-extractability in the quantum random-oracle model (Q2170106) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
