How to build time-lock encryption
From MaRDI portal
Publication:1791669
DOI10.1007/s10623-018-0461-xzbMath1400.68070OpenAlexW2788054796WikidataQ121302343 ScholiaQ121302343MaRDI QIDQ1791669
Jia Liu, Bogdan Warinschi, Tibor Jager, Saqib A. Kakvi
Publication date: 10 October 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0461-x
snarksbitcoinwitness encryptiontime-lock encryptiontime-lock puzzlestimed commitmentstimed-release encryption
Related Items
Security definitions on time-lock puzzles, Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract), Storing and Retrieving Secrets on a Blockchain, Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments, Transparent batchable time-lock puzzles and applications to Byzantine consensus, Witness encryption from smooth projective hashing system, KDM security for the Fujisaki-Okamoto transformations in the QROM, On secure ratcheting with immediate decryption, Astrolabous: a universally composable time-lock encryption scheme, Forward-secure public key encryption without key update from proof-of-stake blockchain, Offline witness encryption with semi-adaptive security, Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era, Abuse resistant law enforcement access systems, Towards witness encryption without multilinear maps
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to Avoid Obfuscation Using Witness PRFs
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of GGH Map
- Practical Multilinear Maps over the Integers
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- How to Run Turing Machines on Encrypted Data
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Low Overhead Broadcast Encryption from Multilinear Maps
- Witness Encryption from Instance Independent Assumptions
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
- Cryptanalysis of the Multilinear Map over the Integers
- The Bitcoin Backbone Protocol: Analysis and Applications
- How to Obfuscate Programs Directly
- Majority Is Not Enough: Bitcoin Mining Is Vulnerable
- Publicly verifiable proofs of sequential work
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- Improved Anonymous Timed-Release Encryption
- General Certificateless Encryption and Timed-Release Encryption
- Time-Specific Encryption
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Candidate Multilinear Maps from Ideal Lattices
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Time-Lock Puzzles in the Random Oracle Model
- Graph-Induced Multilinear Maps from Lattices
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Cryptanalyses of Candidate Branching Program Obfuscators
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Information and Communications Security
- On the (im)possibility of obfuscating programs
- Revocable Quantum Timed-Release Encryption
- Protecting Obfuscation against Algebraic Attacks
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Pebbling and Proofs of Work
- Witness encryption and its applications
- Modeling Bitcoin Contracts by Timed Automata
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On Extractability Obfuscation
