Pages that link to "Item:Q2778839"
From MaRDI portal
The following pages link to Efficient and non-interactive non-malleable commitment (Q2778839):
Displaying 25 items.
- Concurrent non-malleable statistically hiding commitment (Q436560) (← links)
- Secret sharing with statistical privacy and computational relaxed non-malleability (Q831625) (← links)
- Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms (Q999185) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Efficient commitment schemes with bounded sender and unbounded receiver (Q1291804) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- Non-malleable functions and their applications (Q2121503) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security (Q2822671) (← links)
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort (Q3540059) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor (Q3600328) (← links)
- Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1 (Q3623036) (← links)
- Grid-Obstacle Representations with Connections to Staircase Guarding (Q4625102) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Message-Restriction-Free Commitment Scheme Based on Lattice Assumption (Q5095924) (← links)
- Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- A bivariate polynomial-based cryptographic hard problem and its applications (Q6109708) (← links)
- Non-interactive Mimblewimble transactions, revisited (Q6135418) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Revisiting RSA-polynomial problem and semiprime factorization (Q6558638) (← links)
