( en | de | ru )

 

Disambiguation of "Stifter, Nicholas"

Author of the publication

copydeleteadd this publication to your clipboard
Echoes of the Past: Recovering Blockchain Metrics from Merged Mining.

, , , , , and . Financial Cryptography, volume 11598 of Lecture Notes in Computer Science, page 527-549. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ingo Stifter

Julia Stifter

Peter Stifter

Friederike Stifter

Elfriede Stifter

 

Other publications of authors with the same name

Echoes of the Past: Recovering Blockchain Metrics From Merged Mining., , , , , and . IACR Cryptology ePrint Archive, (2018)Pitchforks in Cryptocurrencies: - Enforcing Rule Changes Through Offensive Forking- and Consensus Techniques (Short Paper)., , , and . DPM/CBT@ESORICS, volume 11025 of Lecture Notes in Computer Science, page 197-206. Springer, (2018)HydRand: Efficient Continuous Distributed Randomness., , , and . SP, page 73-89. IEEE, (2020)Pay to Win: Cheap, Cross-Chain Bribing Attacks on PoW Cryptocurrencies., , , , , , , and . Financial Cryptography Workshops, volume 12676 of Lecture Notes in Computer Science, page 533-549. Springer, (2021)Echoes of the Past: Recovering Blockchain Metrics from Merged Mining., , , , , and . Financial Cryptography, volume 11598 of Lecture Notes in Computer Science, page 527-549. Springer, (2019)Flux: Revisiting Near Blocks for Proof-of-Work Blockchains., , , , and . IACR Cryptology ePrint Archive, (2018)Estimating (Miner) Extractable Value is Hard, Let's Go Shopping!, , , and . Financial Cryptography Workshops, volume 13412 of Lecture Notes in Computer Science, page 74-92. Springer, (2022)SoK: Algorithmic Incentive Manipulation Attacks on Permissionless PoW Cryptocurrencies., , , , , , , and . Financial Cryptography Workshops, volume 12676 of Lecture Notes in Computer Science, page 507-532. Springer, (2021)How much is the fork? Fast Probability and Profitability Calculation during Temporary Forks., , , and . WWW (Companion Volume), page 467-477. ACM, (2022)RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness., , , , and . NDSS, The Internet Society, (2021)