• Corpus ID: 109927100

Iterated Search Problems and Blockchain Security under Falsifiable Assumptions

@article{Garay2019IteratedSP,
  title={Iterated Search Problems and Blockchain Security under Falsifiable Assumptions},
  author={Juan A. Garay and Aggelos Kiayias and Giorgos Panagiotakos},
  journal={IACR Cryptol. ePrint Arch.},
  year={2019},
  volume={2019},
  pages={315}
}
We put forth a new class of search problems, iterated search problems (ISP), and study their relation to the design of secure blockchain protocols. We prove that (i) the Bitcoin blockchain protocol implies a hard ISP problem, but ISP hardness is not by itself su cient to prove its security, and (ii) a suitably enhanced class of ISPs is su cient to imply, via construction, a secure blockchain protocol in the common reference string (CRS) model. We then put forth a speci c proposal for an… 

Figures and Tables from this paper

Post-Quantum Blockchain Proofs of Work

It is proved that the chain of PoWs problem reduces to a problem the authors call multi-solution Bernoulli search, for which it establishes its quantum query complexity and is an extension of a threshold direct product theorem to an average-case unstructured search problem.

Consensus from Signatures of Work

This work formalizes a building block that is sufficient for designing consensus protocols in this setting where no authentication or even point-to-point communication is available and relies on a very strong independence assumption about adversarial accesses to the underlying computational resource.

Multi-instance Publicly Verifiable Time-Lock Puzzle and Its Applications

C-TLP is used to build the first “outsourced proofs of retrievability” that can support real-time detection and fair payment while having lower overhead than the state of the art.

References

SHOWING 1-10 OF 50 REFERENCES

Speed-Security Tradeo s in Blockchain Protocols

This work investigates the tradeo between provable security and transaction processing speed viewing the latter as a function of the block generation rate, and introduces a new formal property of blockchain protocols, called chain growth, and shows it is fundamental for arguing the security of a robust transaction ledger.

Analysis of the Blockchain Protocol in Asynchronous Networks

Nakamoto’s famous blockchain protocol enables achieving consensus in a so-called permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not depend

Pseudonymous Secure Computation from Time-Lock Puzzles

Taking inspiration from Bitcoin, it is shown that precise bounds on computational power can be used in place of pre-existing setup to achieve weaker (but nontrivial) notions of security.

Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup

The Bitcoin backbone protocol (Eurocrypt 2015) extracts basic properties of Bitcoin’s underlying blockchain data structure, such as “common prefix” and “chain quality,” and shows how fundamental

Distributed Cryptography Based on the Proofs of Work

A formal model for constructing distributed crypto- graphic protocols in a fully peer-to-peer scenario under the assumption that the adver- sary has limited computing power is proposed and the following protocols working in it are constructed.

Consensus from Signatures of Work

This work formalizes a building block that is sufficient for designing consensus protocols in this setting where no authentication or even point-to-point communication is available and relies on a very strong independence assumption about adversarial accesses to the underlying computational resource.

Separating succinct non-interactive arguments from all falsifiable assumptions

A broad black-box separation result is given, showing that black- box reductions cannot be used to prove the security of any SNARG construction based on any falsifiable cryptographic assumption.

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

A general framework that allows one to construct secure encryption schemes in a generic fashion from language membership problems that satisfy certain technical requirements is introduced, as does the Cramer-Shoup scheme based on the Decision Diffie-Hellman assumption.

On the (In)security of the Fiat-Shamir paradigm

  • S. GoldwasserY. Kalai
  • Computer Science, Mathematics
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
It is shown that there exist secure 3-round public-coin identification schemes for which the Fiat-Shamir transformation yields insecure digital signature schemes for any hash function used by the transformation.

Moderately Hard Functions: Definition, Instantiations, and Applications

The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two.