Pages that link to "Item:Q2181867"
From MaRDI portal
The following pages link to Homomorphic time-lock puzzles and applications (Q2181867):
Displayed 20 items.
- Security definitions on time-lock puzzles (Q831622) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Delay encryption (Q2056688) (← links)
- Generic compiler for publicly verifiable covert multi-party computation (Q2056768) (← links)
- Multi-instance publicly verifiable time-lock puzzle and its applications (Q2147261) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments (Q6070773) (← links)
- Transparent batchable time-lock puzzles and applications to Byzantine consensus (Q6070776) (← links)
- TIDE: a novel approach to constructing timed-release encryption (Q6108784) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Trustworthy sealed-bid auction with low communication cost atop blockchain (Q6126676) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- Time-release cryptography from minimal circuit assumptions (Q6157610) (← links)
- Towards practical homomorphic time-lock puzzles: applicability and verifiability (Q6173300) (← links)
- Completeness theorems for adaptively secure broadcast (Q6186585) (← links)
- Lattice-based timed cryptography (Q6190157) (← links)