Pages that link to "Item:Q5199183"
From MaRDI portal
The following pages link to Time-Lock Puzzles in the Random Oracle Model (Q5199183):
Displayed 13 items.
- Security definitions on time-lock puzzles (Q831622) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Generic-group delay functions require hidden-order groups (Q2055651) (← links)
- Generic compiler for publicly verifiable covert multi-party computation (Q2056768) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- Turn-based communication channels (Q2697935) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Astrolabous: a universally composable time-lock encryption scheme (Q6157525) (← links)
- Completeness theorems for adaptively secure broadcast (Q6186585) (← links)