Timed commitments. (Extended abstract)
From MaRDI portal
Recommendations
- Timeliness, failure-detectors, and consensus performance
- On the rational behaviors of concurrent timers
- Bounds on the time to reach agreement in the presence of timing uncertainty
- Timeliness-based wait-freedom, a gracefully degrading progress condition
- On the expressiveness of timed coordination models
- Reachability of communicating timed processes
- Bounded Concurrent Time-Stamping
- A CALCULUS OF TIMED COMMUNICATING SYSTEMS
Cited in
(67)- Timed-release computational secret sharing and threshold encryption
- How to build time-lock encryption
- Continuous verifiable delay functions
- TARDIS: a foundation of time-lock puzzles in UC
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
- SoK: communication across distributed ledgers
- Multi-instance publicly verifiable time-lock puzzle and its applications
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Minting mechanism for proof of stake blockchains
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- Contract signing, optimism, and advantage
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Turn-based communication channels
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- Three Approaches to Timed External Choice in UTP
- Timed release of standard digital signatures (extended abstract)
- Reliable Timeout Based Commit Protocol
- Towards a security model for computational puzzle schemes
- On complete primitives for fairness
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Partial fairness in secure two-party computation
- Timed encryption with application to deniable key exchange
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Timed-Release Encryption Revisited
- Formal abstractions for attested execution secure processors
- Timed fair exchange of standard signatures (extended abstract)
- Efficient verifiable delay functions
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Quantum multi-party fair exchange protocol based on three-particle GHZ states
- Practical statistically-sound proofs of exponentiation in any group
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Short-lived zero-knowledge proofs and signatures
- Astrolabous: a universally composable time-lock encryption scheme
- Time-release cryptography from minimal circuit assumptions
- Towards practical homomorphic time-lock puzzles: applicability and verifiability
- Applications of timed-release encryption with implicit authentication
- Completeness theorems for adaptively secure broadcast
- Lattice-based timed cryptography
- Accountable storage
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Optimally-fair multi-party exchange without trusted parties
- Resource fairness and composability of cryptographic protocols
- Optimally-fair exchange of secrets via delay encryption and commutative blinding
- Bicorn: an optimistically efficient distributed randomness beacon
- McFly: verifiable encryption to the future made practical
- Synchronizable fair exchange
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- How (not) to hash into class groups of imaginary quadratic fields?
- Proofs of sequential communication delays from physical assumptions and their applications
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Black-box timed commitments from time-lock puzzles
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- Timed secret sharing
- Chained time lock puzzle with small puzzle size
- BTLE: atomic swaps with time-lock puzzles
- Time/space tradeoffs for generic attacks on delay functions
- Separating verifiable delay functions and time-lock puzzles
- Fair multiparty coin tossing from minimal assumptions
- Challenges in timed-cryptography
- A note on the Dwork-Naor timed deniable authentication
- Time consistent commitments of intermediate duration
This page was built for publication: Timed commitments. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536805)
