The following pages link to (Q4536805):
Displaying 47 items.
- Partial fairness in secure two-party computation (Q421046) (← links)
- Timed encryption with application to deniable key exchange (Q477191) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- A note on the Dwork-Naor timed deniable authentication (Q845814) (← links)
- Time consistent commitments of intermediate duration (Q899916) (← links)
- Timed-release computational secret sharing and threshold encryption (Q1692147) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system (Q2118860) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← 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)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- Contract signing, optimism, and advantage (Q2484408) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- Turn-based communication channels (Q2697935) (← links)
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures (Q2794502) (← links)
- Three Approaches to Timed External Choice in UTP (Q2814612) (← links)
- Reliable Timeout Based Commit Protocol (Q3053257) (← links)
- Towards a security model for computational puzzle schemes (Q3101621) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Fair Threshold Decryption with Semi-Trusted Third Parties (Q3634502) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Cryptography and Game Theory: Designing Protocols for Exchanging Information (Q5445513) (← links)
- Timed-Release Encryption Revisited (Q5505456) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- Computer Aided Verification (Q5900592) (← links)
- Efficient verifiable delay functions (Q5919019) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- Quantum multi-party fair exchange protocol based on three-particle GHZ states (Q6072540) (← 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)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- Astrolabous: a universally composable time-lock encryption scheme (Q6157525) (← links)
- Time-release cryptography from minimal circuit assumptions (Q6157610) (← links)
- Accountable Storage (Q6487222) (← links)
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer (Q6488390) (← links)
- Optimally-fair multi-party exchange without trusted parties (Q6550628) (← links)
- Optimally-fair exchange of secrets via delay encryption and commutative blinding (Q6573951) (← links)
- Bicorn: an optimistically efficient distributed randomness beacon (Q6573968) (← links)
- McFly: verifiable encryption to the future made practical (Q6573969) (← links)
- Synchronizable fair exchange (Q6581797) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
