I. Bentov

Publications
Influence

Snow White: Provably Secure Proofs of Stake

I. Bentov, R. Pass, E. Shi
Computer Science
IACR Cryptol. ePrint Arch.
2016

In this work, we provide the first consensus candidate that provably satisfies the desired robustness properties for proofs-of-stake. Expand

Proof of Activity: Extending Bitcoin's Proof of Work via Proof of Stake [Extended Abstract]y

I. Bentov, Charles Lee, Alex Mizrahi, M. Rosenfeld
Computer Science, Mathematics
PERV
8 December 2014

We propose a new protocol for a cryptocurrency, that builds upon the Bitcoin protocol by combining its Proof of Work component with a Proof of Stake type of system. Expand

Cryptocurrencies Without Proof of Work

I. Bentov, A. Gabizon, Alex Mizrahi
Computer Science
Financial Cryptography Workshops
22 June 2014

We study decentralized cryptocurrency protocols in which the participants do not deplete physical scarce resources, and argue that they help in mitigating problems that the existing protocols exhibit. Expand

How to Use Bitcoin to Design Fair Protocols

I. Bentov, R. Kumaresan
Computer Science
CRYPTO
17 August 2014

We study a model of fairness in secure computation in which an adversarial party that aborts on receiving output is forced to pay a mutually predefined monetary penalty. Expand

Sprites and State Channels: Payment Networks that Go Faster Than Lightning

A. Miller, I. Bentov, S. Bakshi, R. Kumaresan, Patrick McCorry
Computer Science
Financial Cryptography
19 February 2017

We propose a novel variant of payment channels, called Sprites, that reduces the worst-case "collateral cost" that each hop along the route may incur. Expand

Scalable, transparent, and post-quantum secure computational integrity

E. Ben-Sasson, I. Bentov, Y. Horesh, Michael Riabzev
Computer Science
IACR Cryptol. ePrint Arch.
2018

We report the first realization of a transparent ZK system (ZK-STARK) in which verification scales exponentially faster than database size, and moreover, this exponential speedup in verification is observed concretely for meaningful and sequential computations. Expand

Sprites: Payment Channels that Go Faster than Lightning

A. Miller, I. Bentov, R. Kumaresan, Patrick McCorry
Computer Science
ArXiv
19 February 2017

We develop a novel construction for payment channels that reduces the worst-case “collateral cost” for offchain payments. Expand

Pisa: Arbitration Outsourcing for State Channels

Patrick McCorry, S. Bakshi, I. Bentov, A. Miller, S. Meiklejohn
Computer Science
IACR Cryptol. ePrint Arch.
21 October 2019

We present Pisa, the first protocol to propose an accountable third party who can be hired by parties to cancel execution forks on their behalf. Expand

How to Use Bitcoin to Incentivize Correct Computations

R. Kumaresan, I. Bentov
Computer Science
CCS
3 November 2014

We study a model of incentivizing correct computations in a variety of cryptographic tasks, namely verifiable computation, secure computation, fair computation, and bounty mechanisms. Expand

How to Use Bitcoin to Play Decentralized Poker

R. Kumaresan, T. Moran, I. Bentov
Computer Science
CCS
12 October 2015

We formalize, generalize, and construct multiparty protocols for the primitive suggested by Andrychowicz et al. to perform secure multiparty computations on Bitcoin. Expand

Recommended Authors