Emmanuelle Anceaume
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Emmanuelle Anceaume has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Bruno Sericola
Inria, Rennes, France
8 shared publications - Romaric Ludinard
IMT Atlantique / IRISA, Rennes, France
5 shared publications - Yves Mocquard
Université de Rennes 1/IRISA
5 shared publications - Thomas Sirvent
DGA Maîtrise de l'Information/IRISA Rennes France
4 shared publications - Valérie Viet
CentraleSupélec/IRISA
4 shared publications - Antonella Del Pozzo
CEA LIST, Palaiseau, France, CEA, Gif-sur-Yvette, France, and Université Paris-Saclay, Gif-sur-Yvette, France
3 shared publications
Latest Publications
- Open Access
- 14 October 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 6 (1) , 1-3
Introduction to the Special Issue on Blockchain Research and Applications for Innovative Networks and Services (BRAINS 2024)
- 14 October 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 6 (1) , 1-3
Open AccessIntroduction to the Special Issue on Blockchain Research and Applications for Innovative Networks and Services (BRAINS 2024)
- Open Access
- 25 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 20 (4) , 1-21
Ethical Risk Analysis of L2 Rollups
Layer 2 rollups improve throughput and fees, but can reintroduce risk through operator discretion and information asymmetry. We ask which operator and governance designs produce ethically problematic user risk. We adapt Ethical Risk Analysis to rollup architectures, build a role-based taxonomy of decision authority and exposure, and pair the framework with two empirical signals, a cross sectional snapshot of 129 projects from L2BEAT and a hand curated incident set covering 2022 to 2025. We analyze mechanisms that affect risks to users’ funds, including upgrade timing and exit windows, proposer liveness and whitelisting, forced inclusion usability, and data availability choices. We find that ethical hazards rooted in L2 components control arrangements are widespread: instant upgrades without exit windows appear in about 86 percent of projects, and proposer controls that can freeze withdrawals in about 50 percent. Reported incidents concentrate in sequencer liveness and inclusion, consistent with these dependencies. We translate these findings into ethically grounded suggestions on mitigation strategies including technical components and governance mechanisms.
- 25 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 20 (4) , 1-21
Open AccessEthical Risk Analysis of L2 Rollups
Layer 2 rollups improve throughput and fees, but can reintroduce risk through operator discretion and information asymmetry. We ask which operator and governance designs produce ethically problematic user risk. We adapt Ethical Risk Analysis to rollup architectures, build a role-based taxonomy of decision authority and exposure, and pair the framework with two empirical signals, a cross sectional snapshot of 129 projects from L2BEAT and a hand curated incident set covering 2022 to 2025. We analyze mechanisms that affect risks to users’ funds, including upgrade timing and exit windows, proposer liveness and whitelisting, forced inclusion usability, and data availability choices. We find that ethical hazards rooted in L2 components control arrangements are widespread: instant upgrades without exit windows appear in about 86 percent of projects, and proposer controls that can freeze withdrawals in about 50 percent. Reported incidents concentrate in sequencer liveness and inclusion, consistent with these dependencies. We translate these findings into ethically grounded suggestions on mitigation strategies including technical components and governance mechanisms.
- Open Access
Ethical Risk Analysis of L2 Rollups
Layer 2 rollups improve throughput and fees, but can reintroduce risk through operator discretion and information asymmetry. We ask which operator and governance designs produce ethically problematic user risk. We adapt Ethical Risk Analysis to rollup architectures, build a role-based taxonomy of decision authority and exposure, and pair the framework with two empirical signals, a cross sectional snapshot of 129 projects from L2BEAT and a hand curated incident set covering 2022 to 2025. We analyze mechanisms that affect risks to users funds, including upgrade timing and exit windows, proposer liveness and whitelisting, forced inclusion usability, and data availability choices. We find that ethical hazards rooted in L2 components control arrangements are widespread: instant upgrades without exit windows appear in about 86 percent of projects, and proposer controls that can freeze withdrawals in about 50 percent. Reported incidents concentrate in sequencer liveness and inclusion, consistent with these dependencies. We translate these findings into ethically grounded suggestions on mitigation strategies including technical components and governance mechanisms.
Open AccessEthical Risk Analysis of L2 Rollups
Layer 2 rollups improve throughput and fees, but can reintroduce risk through operator discretion and information asymmetry. We ask which operator and governance designs produce ethically problematic user risk. We adapt Ethical Risk Analysis to rollup architectures, build a role-based taxonomy of decision authority and exposure, and pair the framework with two empirical signals, a cross sectional snapshot of 129 projects from L2BEAT and a hand curated incident set covering 2022 to 2025. We analyze mechanisms that affect risks to users funds, including upgrade timing and exit windows, proposer liveness and whitelisting, forced inclusion usability, and data availability choices. We find that ethical hazards rooted in L2 components control arrangements are widespread: instant upgrades without exit windows appear in about 86 percent of projects, and proposer controls that can freeze withdrawals in about 50 percent. Reported incidents concentrate in sequencer liveness and inclusion, consistent with these dependencies. We translate these findings into ethically grounded suggestions on mitigation strategies including technical components and governance mechanisms.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 888-902
Mining in Logarithmic Space with Variable Difficulty
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 888-902
Open AccessMining in Logarithmic Space with Variable Difficulty
- Open Access
- 17 February 2025
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 4 (1) , 1-2
Introduction to the Special Issue on “Blockchain Research and Applications for Innovative Networks and Services (BRAINS 2023)”
- 17 February 2025
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 4 (1) , 1-2
Open AccessIntroduction to the Special Issue on “Blockchain Research and Applications for Innovative Networks and Services (BRAINS 2023)”
- Open Access
Mining in Logarithmic Space with Variable Difficulty
This paper addresses both the storage and communication complexity issues of the blockchain. Techniques exist to optimize application data, whose size may grow or shrink over time. On the other hand, consensus data is vital to guarantee the trust we have in the blockchain, and is kept in its entirety. The Non-Interactive Proof of Proof-of-Work primitive addresses this scalability issue assuming a fixed computational power. We present for the first time a construction that provably satisfies the requirements of a non-interactive proof of proof-of-work that is secure against a 1/3 adversary in a dynamic environment. Succinctness, security and onlineness of the scheme are proven, while experimental results confirm the exponential reduction of the Bitcoin blockchain.
Open AccessMining in Logarithmic Space with Variable Difficulty
This paper addresses both the storage and communication complexity issues of the blockchain. Techniques exist to optimize application data, whose size may grow or shrink over time. On the other hand, consensus data is vital to guarantee the trust we have in the blockchain, and is kept in its entirety. The Non-Interactive Proof of Proof-of-Work primitive addresses this scalability issue assuming a fixed computational power. We present for the first time a construction that provably satisfies the requirements of a non-interactive proof of proof-of-work that is secure against a 1/3 adversary in a dynamic environment. Succinctness, security and onlineness of the scheme are proven, while experimental results confirm the exponential reduction of the Bitcoin blockchain.
- 23 October 2023
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 25 (4) , 1-21
Continuous-Time Stochastic Analysis of Rumor Spreading with Multiple Operations
- 23 October 2023
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 25 (4) , 1-21
Continuous-Time Stochastic Analysis of Rumor Spreading with Multiple Operations
- 7 October 2023
- Published by Springer Nature
- p. 34-48
Stochastic Analysis of Rumor Spreading with Multiple Pull Operations in Presence of Non-cooperative Nodes
- 7 October 2023
- Published by Springer Nature
- p. 34-48
Stochastic Analysis of Rumor Spreading with Multiple Pull Operations in Presence of Non-cooperative Nodes
- Open Access
Extending The Boundaries and Exploring The Limits Of Blockchain Compression
Blockchain technology aims to replace traditional banking systems and manage the world's economic data. However, the long-term feasibility of blockchain technology is hindered by the inability of existing blockchain protocols to prune the consensus data leading to constantly growing storage and communication requirements. Kiayias et al. have proposed a blockchain protocol based on superblock Non-Interactive-Proofs-of-Proof-of-Work (NIPoPoWs) as a mechanism to reduce the storage and communication complexity of blockchains to O(polylog(n)). However, their protocol is only resilient to an adversary that may control strictly less than 1/3rd of the total computational power, which is a reduction from the security guaranteed by Bitcoin and other existing blockchain protocols that guarantee security against an adversary that may control strictly less than 1/2 of the total computational power. We present an improvement to the Kiayias et al. proposal termed Gems-scheme, which is resilient against an adversary that may control less than 1/2 of the total computational power while operating in O(polylog(n)) storage and communication complexity. Additionally, we present a novel proof that establishes a lower bound of O(log(n)) on the storage and communication complexity of any PoW-based blockchain protocol.
Open AccessExtending The Boundaries and Exploring The Limits Of Blockchain Compression
Blockchain technology aims to replace traditional banking systems and manage the world's economic data. However, the long-term feasibility of blockchain technology is hindered by the inability of existing blockchain protocols to prune the consensus data leading to constantly growing storage and communication requirements. Kiayias et al. have proposed a blockchain protocol based on superblock Non-Interactive-Proofs-of-Proof-of-Work (NIPoPoWs) as a mechanism to reduce the storage and communication complexity of blockchains to O(polylog(n)). However, their protocol is only resilient to an adversary that may control strictly less than 1/3rd of the total computational power, which is a reduction from the security guaranteed by Bitcoin and other existing blockchain protocols that guarantee security against an adversary that may control strictly less than 1/2 of the total computational power. We present an improvement to the Kiayias et al. proposal termed Gems-scheme, which is resilient against an adversary that may control less than 1/2 of the total computational power while operating in O(polylog(n)) storage and communication complexity. Additionally, we present a novel proof that establishes a lower bound of O(log(n)) on the storage and communication complexity of any PoW-based blockchain protocol.
- 20 November 2021
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 24 (3) , 2195-2211
Stochastic Analysis of Rumor Spreading with Multiple Pull Operations
- 20 November 2021
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 24 (3) , 2195-2211
Stochastic Analysis of Rumor Spreading with Multiple Pull Operations