How to build time-lock encryption
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 1996402 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Cryptanalyses of Candidate Branching Program Obfuscators
- Cryptanalysis of GGH map
- Cryptanalysis of the multilinear map over the integers
- GGHLite: more efficient multilinear maps from ideal lattices
- General Certificateless Encryption and Timed-Release Encryption
- Graph-induced multilinear maps from lattices
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- How to avoid obfuscation using witness PRFs
- How to obfuscate programs directly
- How to run Turing machines on encrypted data
- Improved Anonymous Timed-Release Encryption
- Information and Communications Security
- Lattice-based SNARGs and their application to more efficient obfuscation
- Low overhead broadcast encryption from multilinear maps
- Majority is not enough: bitcoin mining is vulnerable
- Modeling Bitcoin contracts by timed automata
- New Multilinear Maps Over the Integers
- On extractability obfuscation
- On the (im)possibility of obfuscating programs
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Pebbling and Proofs of Work
- Practical multilinear maps over the integers
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Protecting obfuscation against algebraic attacks
- Publicly verifiable proofs of sequential work
- Quadratic span programs and succinct NIZKs without PCPs
- Revocable quantum timed-release encryption
- Scalable zero knowledge via cycles of elliptic curves
- Short pairing-based non-interactive zero-knowledge arguments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Succinct non-interactive arguments via linear interactive proofs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- The Bitcoin Backbone Protocol: Analysis and Applications
- Time-lock puzzles in the random oracle model
- Time-specific encryption
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Witness encryption and its applications
- Witness encryption from instance independent assumptions
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Cited in
(17)- Witness encryption from smooth projective hashing system
- PURED: a unified framework for resource-hard functions
- Time-lock puzzles from lattices
- Security definitions on time-lock puzzles
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- On secure ratcheting with immediate decryption
- Abuse resistant law enforcement access systems
- Astrolabous: a universally composable time-lock encryption scheme
- Forward-secure public key encryption without key update from proof-of-stake blockchain
- McFly: verifiable encryption to the future made practical
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Storing and retrieving secrets on a blockchain
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- Towards witness encryption without multilinear maps
- Offline witness encryption with semi-adaptive security
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
This page was built for publication: How to build time-lock encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791669)
