Peter Gazi

Orcid: 0000-0003-1572-3255

According to our database1, Peter Gazi authored at least 45 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Fait Accompli Committee Selection: Improving the Size-Security Tradeoff of Stake-Based Committees.
IACR Cryptol. ePrint Arch., 2023

2022
Practical Settlement Bounds for Longest-Chain Consensus.
IACR Cryptol. ePrint Arch., 2022

On UC-Secure Range Extension and Batch Verification for ECVRF.
IACR Cryptol. ePrint Arch., 2022

SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients.
IACR Cryptol. ePrint Arch., 2022

A Composable Security Treatment of ECVRF and Batch Verifications.
Proceedings of the Computer Security - ESORICS 2022, 2022

2021
Practical Settlement Bounds for Proof-of-Work Blockchains.
IACR Cryptol. ePrint Arch., 2021

Pay to Win: Cheap, Cross-Chain Bribing Attacks on PoW Cryptocurrencies.
Proceedings of the Financial Cryptography and Data Security. FC 2021 International Workshops, 2021

Fast Isomorphic State Channels.
Proceedings of the Financial Cryptography and Data Security, 2021

Dynamic Ad Hoc Clock Synchronization.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
SoK: Algorithmic Incentive Manipulation Attacks on Permissionless PoW Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2020

Tight Consistency Bounds for Bitcoin.
IACR Cryptol. ePrint Arch., 2020

Ledger Combiners for Fast Settlement.
IACR Cryptol. ePrint Arch., 2020

Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput.
IACR Cryptol. ePrint Arch., 2020

Hydra: Fast Isomorphic State Channels.
IACR Cryptol. ePrint Arch., 2020

Consensus Redux: Distributed Ledgers in the Face of Adversarial Supremacy.
IACR Cryptol. ePrint Arch., 2020

Stake Shift in Major Cryptocurrencies: An Empirical Study.
Proceedings of the Financial Cryptography and Data Security, 2020

2019
Pay-To-Win: Incentive Attacks on Proof-of-Work Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2019

Ouroboros Chronos: Permissionless Clock Synchronization via Proof-of-Stake.
IACR Cryptol. ePrint Arch., 2019

2018
Proof-of-Stake Sidechains.
IACR Cryptol. ePrint Arch., 2018

Stake-Bleeding Attacks on Proof-of-Stake Blockchains.
IACR Cryptol. ePrint Arch., 2018

Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition.
IACR Cryptol. ePrint Arch., 2018

Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability.
IACR Cryptol. ePrint Arch., 2018

Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
The Exact Security of PMAC.
IACR Cryptol. ePrint Arch., 2017

Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol.
IACR Cryptol. ePrint Arch., 2017

2016
Provably Robust Sponge-Based PRNGs and KDFs.
IACR Cryptol. ePrint Arch., 2016

Per-Session Security: Password-Based Cryptography Revisited.
IACR Cryptol. ePrint Arch., 2016

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
IACR Cryptol. ePrint Arch., 2016

2015
Spacemint: A Cryptocurrency Based on Proofs of Space.
IACR Cryptol. ePrint Arch., 2015

Generic Security of NMAC and HMAC with Input Whitening.
IACR Cryptol. ePrint Arch., 2015

Tight Bounds for Keyed Sponges and Truncated CBC.
IACR Cryptol. ePrint Arch., 2015

Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.
IACR Cryptol. ePrint Arch., 2015

Query-Complexity Amplification for Random Oracles.
IACR Cryptol. ePrint Arch., 2015

Secret-key cryptography from ideal primitives: A systematic overview.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
The Exact PRF-Security of NMAC and HMAC.
IACR Cryptol. ePrint Arch., 2014

Optimality of Non-Adaptive Strategies: The Case of Parallel Games.
IACR Cryptol. ePrint Arch., 2014

2013
On the Security of Plain and Randomized Cascades.
IACR Cryptol. ePrint Arch., 2013

Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading.
IACR Cryptol. ePrint Arch., 2012

Resource-Restricted Indifferentiability.
IACR Cryptol. ePrint Arch., 2012

2009
Cascade Encryption Revisited.
IACR Cryptol. ePrint Arch., 2009

Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

2008
Assisted Problem Solving and Decompositions of Finite Automata.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007
On Ciphertext Undetectability.
IACR Cryptol. ePrint Arch., 2007


  Loading...