scientific article; zbMATH DE number 1759782
From MaRDI portal
Publication:4536805
zbMath0989.94517MaRDI QIDQ4536805
Publication date: 6 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (40)
A note on the Dwork-Naor timed deniable authentication ⋮ 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) ⋮ 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 ⋮ Timed-release computational secret sharing and threshold encryption ⋮ 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 ⋮ Partial fairness in secure two-party computation ⋮ 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 ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Resource fairness and composability of cryptographic protocols ⋮ Timed encryption with application to deniable key exchange ⋮ Minting mechanism for proof of stake blockchains ⋮ Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era ⋮ Contract signing, optimism, and advantage ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures ⋮ How to build time-lock encryption ⋮ Efficient verifiable delay functions ⋮ Continuous verifiable delay functions ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Towards a security model for computational puzzle schemes ⋮ On Complete Primitives for Fairness ⋮ Timed-Release Encryption Revisited ⋮ New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
This page was built for publication:
