Peter Gazi

According to our database1, Peter Gazi authored at least 31 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput.
IACR Cryptology ePrint Archive, 2020

Stake Shift in Major Cryptocurrencies: An Empirical Study.
CoRR, 2020

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

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

2018
Proof-of-Stake Sidechains.
IACR Cryptology ePrint Archive, 2018

Stake-Bleeding Attacks on Proof-of-Stake Blockchains.
IACR Cryptology ePrint Archive, 2018

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

Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2017

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

2016
Provably Robust Sponge-Based PRNGs and KDFs.
IACR Cryptology ePrint Archive, 2016

Per-Session Security: Password-Based Cryptography Revisited.
IACR Cryptology ePrint Archive, 2016

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

2015
Spacemint: A Cryptocurrency Based on Proofs of Space.
IACR Cryptology ePrint Archive, 2015

Generic Security of NMAC and HMAC with Input Whitening.
IACR Cryptology ePrint Archive, 2015

Tight Bounds for Keyed Sponges and Truncated CBC.
IACR Cryptology ePrint Archive, 2015

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

Query-Complexity Amplification for Random Oracles.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2014

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

2013
On the Security of Plain and Randomized Cascades.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2012

Resource-Restricted Indifferentiability.
IACR Cryptology ePrint Archive, 2012

2009
Cascade Encryption Revisited.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2007


  Loading...