Pages that link to "Item:Q5117380"
From MaRDI portal
The following pages link to Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380):
Displaying 12 items.
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Black-box non-interactive non-malleable commitments (Q2056786) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- On the CCA compatibility of public-key infrastructure (Q2061956) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- COA-secure obfuscation and applications (Q2170027) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
