Pages that link to "Item:Q1110348"
From MaRDI portal
The following pages link to Minimum disclosure proofs of knowledge (Q1110348):
Displaying 16 items.
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- On-line/off-line DCR-based homomorphic encryption and applications (Q6080898) (← links)
- Provably unforgeable threshold EdDSA with an offline participant and trustless setup (Q6095326) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- A coercion-resistant blockchain-based E-voting protocol with receipts (Q6112251) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Forward-secure revocable secret handshakes from lattices (Q6166997) (← links)
- Redactable Transactions in Consortium Blockchain: Controlled by Multi-authority CP-ABE (Q6488396) (← links)
- Commitments with efficient zero-knowledge arguments from subset sum problems (Q6550619) (← links)
- Group encryption: full dynamicity, message filtering and code-based instantiation (Q6564029) (← links)
- Bringing order to chaos: the case of collision-resistant chameleon-hashes (Q6595845) (← links)
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer (Q6595938) (← links)
- Concurrently secure blind Schnorr signatures (Q6636502) (← links)
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions (Q6660291) (← links)
