• Corpus ID: 6003112

Time-release Protocol from Bitcoin and Witness Encryption for SAT

@inproceedings{Liu2015TimereleasePF,
  title={Time-release Protocol from Bitcoin and Witness Encryption for SAT},
  author={Jia Liu},
  year={2015}
}
  • Jia Liu
  • Published 2015
  • Computer Science, Mathematics
We propose a new time-release protocol based on the bitcoin protocol and witness encryption. We derive a “public key” from the bitcoin block chain for encryption. The decryption key are the unpredictable information in the future blocks (e.g., transactions, nonces) that will be computed by the bitcoin network. We build this protocol by witness encryption and encrypt with the bitcoin proof-of-work constraints. The novelty of our protocol is that the decryption key will be automatically and… 
eprint.iacr.org
16 Citations
Highly Influential Citations
2
Background Citations
10
Methods Citations
8
Results Citations
1

Figures from this paper

16 Citations

TIDE: A novel approach to constructing timed-release encryption
  • Computer Science, Mathematics
  • 2022
TLDR
TIDE (TIme Delayed Encryption), a novel approach to constructing timed-release encryption based upon the RSA cryptosystem, where instead of directly encrypting the secret key to the future, the solver is utilised to factor the RSA modulus, and hence derive the decryption key.
How to build time-lock encryption
  • Tibor Jager
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2015
TLDR
A new construction of a witness encryption scheme, based on Subset-Sum, achieves extractable security without relying on obfuscation and is independent of the implementations of multilinear maps.
Practical Time-Release Blockchain
TLDR
This paper proposes a new, practical time-release blockchain, and finds the key to decrypt the content after a certain time, and implements a prototype version of the blockchain system using Python.
Provably Secure Security-Enhanced Timed-Release Encryption in the Random Oracle Model
TLDR
A concrete scheme and a generic scheme of security-enhanced TRE (SETRE) in the random oracle model are proposed and formalized, giving a provably secure concrete construction of SETRE.
Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-
TLDR
This work puts forth the first formal treatment of timestamping cryptographic primitives in the UC framework with respect to a global clock, and proposes timed versions of primitives commonly used for authenticating information, such as digital signatures, non-interactive zero-knowledge proofs, and signatures of knowledge.
Encrypting Into the Future Exploring Time-Lock Encryption Bachelor Thesis
TLDR
An overview over TLE is provided based on three selected constructions based on adequate criteria to provide an overview over the strengths and limitations.
Time-Lock Puzzles from Randomized Encodings
TLDR
It is shown that various flavors of randomized encodings give rise to time-lock puzzles of varying strengths, whose security can be shown assuming the mere existence of non-parallelizing languages, which are languages that require circuits of depth at least t to decide, in the worst-case.
Applied Cryptography and Network Security: 18th International Conference, ACNS 2020, Rome, Italy, October 19–22, 2020, Proceedings, Part I
TLDR
This work introduces new bivariate-polynomials-based sharing techniques allowing to batch up to n − 2 secrets in Proactive Secret Sharing, and tackles the efficiency bottleneck and construct a PSS protocol with O(n/ ) communication complexity for secrets, i.e., an amortized communication complexity of O( n) when the maximum batch size is used.
SilentDelivery: Practical Timed-delivery of Private Information using Smart Contracts
TLDR
SilentDelivery is a secure, scalable and cost-efficient protocol for implementing timed-delivery of private information in a decentralized blockchain network and reduces the cost of running smart contracts by 85%.
Keeping Time-Release Secrets through Smart Contracts
TLDR
The main idea is to encourage public vigilantism by incorporating an informer-bounty mechanism that pays bounty to any informer who can provide evidence of the leakage and be of independent interest to other applications of threshold secret sharing in deterring sharing.
...
...

References

SHOWING 1-10 OF 29 REFERENCES
Witness encryption and its applications
TLDR
The method for witness encryption is introduced and formally defined, which yields the first candidate construction for an open problem posed by Rudich in 1989: constructing computational secret sharing schemes for an NP-complete access structure.
Time-Specific Encryption
TLDR
This paper extends Plain TSE to the public-key and identity-based settings, where receivers are additionally equipped with private keys and either public keys or identities, and where decryption now requires the use of the private key as well as an appropriate TIK.
Witness Encryption from Instance Independent Assumptions
TLDR
A candidate for a witness encryption scheme built using multilinear encodings was provided, but one significant limitation of the work is that the candidate had no proof of security (other than essentially assuming the scheme secure).
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
TLDR
This work gives constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits and shows how to use them together with Fully Homomorphic Encryption to achieve functional encryption for all circuits.
Conditional Oblivious Transfer and Timed-Release Encryption
TLDR
An efficient and secure timed-release encryption scheme using a "time server" which inputs the current time into the system and is based on a novel cryptographic primitive: a variant of oblivious transfer which is called conditional oblivious transfer.
Cryptanalysis of GGH Map
TLDR
This paper presents several efficient attacks on GGH map, aiming at multipartite key exchange MKE and the instance of witness encryption THE AUTHORS based on the hardness of exact-3-cover X3C problem, and presents cryptanalysis of two simple revisions of GGHMap, which shows that MKE can be broken under the assumption that $$2^{K}$$2K is polynomially large.
Bitcoin: A Peer-to-Peer Electronic Cash System
TLDR
This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.
Efficient and Non-interactive Timed-Release Encryption
TLDR
This paper revisits the important problem of sending a message “into the future” in such a way that no communication is needed between the server and other entities and introduces a new stringent model tailored to the non-interactive setting.
Time-lock Puzzles and Timed-release Crypto
TLDR
There are two natural approaches to implementing timed-release crypto: Use ``time-lock puzzles''--computational problems that can not be solved without running a computer continuously for at least a certain amount of time, and use trusted agents who promise not to reveal certain information until a specified date.
Verifiable partial key escrow
TLDR
This work provides schemes to perform partial key escrow in a verifiable manner in a public-key encryption setting and shows that other proposals for verifiable partial key Escrow suffer from the early recovery problem, and thus do not in fact offer an advantage over standard key-escrow schemes.
...
...