• Corpus ID: 14647345

Extractable Witness Encryption and Timed-Release Encryption from Bitcoin

  title={Extractable Witness Encryption and Timed-Release Encryption from Bitcoin},
  author={Jia Liu and Saqib A. Kakvi and Bogdan Warinschi},
  journal={IACR Cryptol. ePrint Arch.},
We propose a new witness encryption based on Subset-Sum which achieves extractable security without relying on obfuscation and is more efficient than the existing ones. Our witness encryption employs multilinear maps of arbitrary order and it is independent of the implementations of multilinear maps. As an application, we construct a new timed-release encryption based on the Bitcoin protocol and extractable witness encryption. The novelty of our scheme is that the decryption key will be… 

Figures from this paper

Security-Enhanced Timed-Release Encryption in the Random Oracle Model
A concrete scheme of TRE in the random oracle model is proposed, which reduces the time consumption by about 10.8%, and has achieved the one-time-pad of the time trapdoor, which greatly enhances the security of the private key of thetime server, and thus enhances theSecurity and effectiveness of the TRE.
Constructing Witness PRF and Offline Witness Encryption Without Multilinear Maps
The authors' scheme is based on a public-key encryption, a witness PRF and employs a sub-exponentially secure randomized encoding scheme in CRS model instantiating obfuscation, and can be turned into an offline functional witness encryption scheme where decryption releases a function of a message and witness as output.
Overcoming Cryptographic Impossibility Results Using Blockchains
This work provides an abstract framework for formally analyzing and defining useful security properties for Proof-of-Stake (POS) based blockchain protocols and introduces the notion of pay-per-use programs which is simply a contract between two parties — service provider and customer.
Provable Security for Cryptocurrencies
This thesis provides a formal specification and construction for each layer of an abstract cryptocurrency protocol, and proves that their constructions satisfy their specifications, and constructs secure puzzles that address important and well-known challenges facing Bitcoin today.
Practical witness encryption for algebraic languages or how to encrypt under Groth–Sahai proofs
It is shown that such THE AUTHORS schemes for subsets of NP complete languages can be generically constructed from smooth projective hash functions and target languages of statements proven in the popular Groth–Sahai non-interactive witness-indistinguishable/zero-knowledge proof framework.
SilentDelivery: Practical Timed-delivery of Private Information using Smart Contracts
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
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.
μchain: How to Forget without Hard Forks
In this paper, we explore an idea of making (proof-of-work) blockchains mutable. We propose and implement μchain, a mutable blockchain, that enables modifications of blockchain history. Blockchains
Secure Zero-Day Detection: Wiping Off the VEP Trade-Off
SeZeDe first integrates secure pattern matching with signature-based intrusion detection to protect the data confidentiality of both sides while still supporting main detection functionalities, and applies the idea of time-lock encryption to deter turning the detection service into a surveillance mechanism.
Root Previous Hash Block Header i Smart Contract Root Account RootNonce Timestamp Transaction Root Previous Hash Block Header i-1 Smart Contract Root Account RootNonce Timestamp Transaction Root Previous Hash Block Header i + 1 Smart Contract Root
In this paper, we explore an idea of making (proof-of-work) blockchains mutable. We propose and implement μchain, a mutable blockchain, that enables modifications of blockchain history. Blockchains


Adaptive Witness Encryption and Asymmetric Password-Based Cryptography
We show by counter-example that the soundness security requirement for witness encryption given by Garg, Gentry, Sahai and Waters (STOC 2013) does not suffice for the security of their own
Witness Encryption from Instance Independent Assumptions
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).
How to build time-lock encryption
  • Tibor Jager
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2015
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.
Conditional Oblivious Transfer and Timed-Release Encryption
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.
Witness encryption and its applications
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.
Efficient and Non-interactive Timed-Release Encryption
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-Specific Encryption
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.
How to Avoid Obfuscation Using Witness PRFs
A construction of witness PRFs from multilinear maps that is simpler and much more efficient than current obfuscation candidates is given, thus bringing several applications of obfuscation closer to practice.
Cryptanalysis of GGH Map
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.
The Bitcoin Backbone Protocol: Analysis and Applications
This work extracts and analyzes the core of the Bitcoin protocol, which is term the Bitcoin backbone, and proves two of its fundamental properties which are called common prefix and chain quality in the static setting where the number of players remains fixed.