Follow blockchain research across journals, conferences, and preprint repositories.
1,684 results · page 12 of 71
Jiazhen Gan, Qihao Yuan, Neng Zhang, Zigui Jiang · 5 authors
No abstract is available for this record.
Steven Paul Nohr
<b><i>Bribe-Based Oracle Echoes</i></b> describe a class of incentive-layer attacks in which economically rational adversaries influence oracle participants to repeatedly reinforce distorted data outputs without directly compromising oracle infrastructure. Unlike overt oracle manipulation, these attacks exploit incentive alignment and tolerance-band logic to create feedback loops in which biased signals are echoed, amplified, and normalized across decentralized finance (DeFi) and stablecoin systems. This paper formalizes the threat model, identifies structural enablers, and demonstrates why decentralization alone is insufficient to prevent economically induced oracle drift.
Hyeonbum Lee, Seunghun Paik, Hyunjung Son, Jae Hong Seo
An inner product argument (IPA) is a cryptographic proof system that serves as a fundamental building block for various applications, such as zero knowledge proofs and verifiable computation. Bulletproofs (IEEE S&P 2018), a well-known IPA under the discrete logarithm (DL) assumption, features a short, logarithmically-sized proof, making it suitable for blockchain applications. However, its major drawback is the linear verifier cost (O(N)), which presents a significant bottleneck in settings like verifiable computation. To address this, recent advancements have successfully reduced the verification complexity to square-root order (O(√N)) under the same assumption (e.g., Asiacrypt 2022, IEEE TIFS). In thiswork, we propose Cougar, a novel IPAthat breaks this square-root barrier to achieve an unprecedented cubic-root verifier complexity (O(3√N)), while strictly maintaining the compact logarithmic proof size (O(logN)) characteristic of Bulletproofs. To achieve this, Cougar introduces a generalized two-tier commitment framework combined with adisjoint interpolationstrategy for efficient consistency checks. We implemented Cougar in Rust and performed a comprehensive benchmarking against Bulletproofs and Leopard (IEEE TIFS). Our evaluation demonstrates that while Cougar incurs a moderate increase in prover overhead, its verification time scales significantly better for large instances. Concretely, for a witness size ofN= 220, Cougar achieves a 50× verification speed-up over Bulletproofs and exhibits a superior asymptotic growth rate compared to existing sublinear IPAs.
Yuexin Kang, Jing Zeng, Qing Xia, Zhilin Wu · 5 authors
No abstract is available for this record.
Oleksandr Kuznetsov, Yulia Khavikova, Valerii Bushkov, Dmytro Shchytov · 5 authors
Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) have emerged as a critical technology for privacy-preserving computation and blockchain applications. However, systematic performance analysis of practical implementations remains limited, hindering informed technology adoption decisions. This study presents a comprehensive benchmarking analysis of the Groth16 protocol implementation using the widely-adopted Circom-snarkjs framework. We developed an automated benchmarking platform that systematically measures performance across seven representative circuit types with varying computational complexity (1-11 R1CS constraints). Our methodology ensures reproducible measurements through controlled experimental design with statistical validation. The platform captures detailed metrics for all three phases of the Groth16 protocol: witness generation, proof creation, and verification. Results from 35 independent measurements reveal several important findings. Witness generation demonstrates consistent performance across circuit types, averaging 57.6±12.1 milliseconds. Proof generation times range from 832 to 1,147 milliseconds, showing non-linear scaling with circuit complexity. Verification times remain relatively stable (741-884 milliseconds), confirming Groth16's theoretical constant-time verification advantage. All measurements achieved 100% success rate with complete proof validation. Notably, circuit structure significantly impacts performance beyond simple constraint counting. Comparison-based circuits achieve 13.22 constraints per second efficiency, substantially outperforming arithmetic circuits (1.02-4.36 constraints/second). This finding provides actionable guidance for circuit design optimization. The study contributes an open-source benchmarking framework for reproducible zk-SNARK research and provides empirical performance data for technology adoption decisions. Our findings support the practical deployment of Groth16 for applications requiring efficient zero-knowledge proofs while highlighting optimization opportunities for circuit designers.
Elvira Albert, Samir Genaim, Enrique Martin-Martin
Abstract Many compilation stages of smart contracts on the Ethereum blockchain have been transitioned to the intermediate language . Tasks such as smart contract optimization and bytecode generation are—or will soon be—performed directly at the level in the compilers for the higher-level languages such as Solidity. In this paper, we develop a formal semantics of programs in Rocq, suitable for verification, which allows formal reasoning at the level of code or generation tools processing programs. Our semantics is expressive enough to be the basis for formal verification tools, and simple enough to make the development of such tools feasible. In order to prove its adequacy for verification, we develop in Rocq a checker (and associated soundness proofs), based on our semantics, able to verify the results of the liveness analysis stage of the official Solidity compiler , which opens the door towards formally verified Ethereum’s smart contracts compilation. Experiments on more than 1,500 smart contracts show that we are able to automatically verify ’s liveness analysis results in negligible time.
Wenhao Wang, Lulu Zhou, Aviv Yaish, Fan Zhang · 6 authors
No abstract is available for this record.
Seema C K, Sharan V Talwar, subhash Chandra K R Patel, S. E. R. Sacha Emile R.
The Internet of Things (IoT) presents critical security challenges including device identity spoofing, replay attacks, and data tampering across billions of deployed endpoints. This work presents ZK-IoTChain, a blockchain-enabled security framework that integrates zk-SNARK-based device authentication with Merkle-anchored data integrity in a unified architecture. The proposed system employs a three-layer design consisting of device-side proof generation, on-chain Groth16 verification, and IPFS-based off-chain storage. This architecture ensures privacy-preserving authentication while maintaining scalability and cost efficiency. Experimental evaluation on the Ethereum Sepolia testnet demonstrates a mean proof generation latency of 3.21 seconds and on-chain verification latency of approximately 125 milliseconds, with an average gas cost of 278,400 per authentication. The framework achieves a 99.98% reduction in storage cost compared to full on-chain approaches. Security analysis under the Dolev–Yao adversary model confirms effective mitigation of identity spoofing, replay attacks, data tampering, and man-in-the-middle (MITM) attacks. The results highlight ZK-IoTChain as a practical and efficient solution for secure, scalable, and privacy-preserving IoT ecosystems.
Steven Paul Nohr
<b><i>Zero-knowledge proof (ZKP) systems</i></b> such as<b><i> zk-SNARKs</i></b> and<b><i> zk-STARKs</i></b> are increasingly promoted as comprehensive solutions for privacy, scalability, and selective disclosure in blockchain-based systems. While these cryptographic primitives provide strong guarantees regarding computational correctness and data confidentiality, they are frequently mischaracterized as substitutes for regulatory compliance, legal enforceability, or supervisory control mechanisms. This paper presents a structural and functional comparison between zero-knowledge proof systems and the Crystal Validator™ (CV), a logic-layer enforcement architecture designed to encode and enforce jurisdiction?aware regulatory requirements. We demonstrate that cryptographic validity proofs are orthogonal to—and insufficient for—legal compliance, accountability, and regulatory supervision as required under frameworks such as the EU Markets in Crypto-Assets Regulation (MiCA). We argue that regulatory enforcement logic must exist above cryptographic proof layers and cannot be replaced by them without introducing systemic compliance risk.
Lukas Aumayr, Zeta Avarikioti, Matteo Maffei, Giulia Scaffino · 5 authors
No abstract is available for this record.
Jin Zhou, Hongzhi Lu, Jianxin Xiong
The integration of continuous Zero Trust Architecture (ZTA) into Segment Routing over IPv6 (SRv6) networks introduces severe performance bottlenecks and physical constraints of the Maximum Transmission Unit (MTU). Specifically, naively embedding massive Zero-Knowledge Proof (ZKP) for per-packet authentication inevitably triggers catastrophic fragmentation and disrupts stateless forwarding. To address these fundamental limitations, this paper proposes a novel session-bound zero-knowledge authorization framework tailored for SRv6 programmable data planes. Our architecture explicitly decouples heavyweight cryptographic validations from the active forwarding path. Massive ZKP payloads are processed asynchronously via payload transmission in the control plane, while the data plane enforces line-rate access control using lightweight 32-byte capability tokens encapsulated in customized SRv6 extension headers. Furthermore, to mathematically balance robust security with forwarding efficiency, we formulate the dynamic verification process as a risk-aware Partially Observable Markov Decision Process (POMDP). Using in-band network telemetry, we derive an Adaptive Threshold Verification (ATV) algorithm that yields a closed-form <inline-formula> <tex-math notation="LaTeX">$O(1)$ </tex-math></inline-formula> complexity optimal scheduling policy. Extensive evaluations demonstrate that the decoupled mechanism seamlessly resolves the MTU bottleneck, maintaining stable baseline throughput under massive concurrent sessions. Concurrently, the ATV algorithm intelligently adapts to real-time threat intensities, conserving control-plane resources during safe periods while instantaneously triggering precise re-verifications against covert and volumetric cyberattacks.
Carl Kwan, Quang Dao, Justin Thaler
No abstract is available for this record.
Björn Johansson, Ferhat Karakoc, Karl Norrman
No abstract is available for this record.
Dhrumil Panchal, Hrushik Mehta, Pragati Shetty, Pratik Kanani · 6 authors
No abstract is available for this record.
E. Poongothai, T. R. Saravanan, K. S. Kavitha Kumari, T. Ananth Kumar · 5 authors
No abstract is available for this record.
Larissa P. V. Randow, Karin S. Komati, Jefferson O. Andrade
No abstract is available for this record.
Boon Chuan Lim
No abstract is available for this record.
Michael Adjedj, Constantin Blokh, Geoffroy Couteau, Arik Galansky · 6 authors
We present a novel protocol for two-party ECDSA that achieves two rounds (a single back-and-forth communication) at the cost of a single oblivious linear function evaluation (OLE). In comparison, the previous work of Boneh, Haitner, Lindell, and Segev (EUROCRYPT 2025) achieves two rounds but requires expensive zero-knowledge proofs on top of the OLE. We demonstrate this by proving that in the generic group model, any adversary capable of generating forgeries for our protocol can be transformed into an adversary that finds preimages for the ECDSA message digest function (e.g., the SHA family). Interestingly, our analysis is closely related to, and has ramifications for, the ‘presignatures’ mode of operation—Canetti, Gennaro, Goldfeder, Makriyannis, and Peled (CCS 2020), Groth and Shoup (EUROCRYPT 2022).Motivated by applications to embedded cryptocurrency wallets, where a single server maintains distinct, shared public keys with separate clients (i.e., a star-shaped topology), and with the goal of minimizing communication, we instantiate our protocol using Paillier encryption and suitable zero-knowledge proofs. To reduce computational overhead, we thoroughly optimize all components of our protocol under sound cryptographic assumptions, specifically small-exponent variants of RSA-style assumptions.Finally, we implement our protocol and provide benchmarks. At the 128-bit security level, the signing phase requires approximately 50 ms of computation time on a standard linux machine, and 2 KB of bandwidth.
Dongyu Meng, Fabio Gritti, Robert McLaughlin, Nicola Ruaro · 7 authors
No abstract is available for this record.
haojia hong, Duan Jia, Wei Ren, Xi Liu · 5 authors
Proxy contracts support logic upgradeability and deployment reuse in decentralized application (DApp). However, the use of proxy mechanisms also introduces new security risks. Although prior work has explored the security of proxy contracts, most prior approaches either depend on source code or fail to handle complex proxy storage layouts at the bytecode level, reducing their applicability to real-world closed-source contracts. In this paper, we propose ProxyLens, a bytecode-level vulnerability detection framework tailored for Ethereum proxy contracts. Without requiring source code, ProxyLens integrates storage structure modeling, proxy pattern recognition, and vulnerability detection. It features (1) a slot recovery mechanism based on symbolic execution and taint analysis for precise variable layout inference, (2) a proxy identification and delegate slot tracing module for accurate proxy architecture recognition, and (3) a semantic-driven vulnerability detection engine that works independently of function names. Experiments show that ProxyLens significantly outperforms existing tools in storage slot recovery (F1 = 96.4%), variable type inference (accuracy = 63.0%), proxy pattern recognition (accuracy > 90% across multiple patterns), and vulnerability detection (e.g., function selector collision F1 = 98.77%, storage collision F1 = 79.50%). As a supplementary contribution, we have publicly released the prototype of ProxyLens.
Pedro Cosme
No abstract is available for this record.
Shraddha M. Naik, Huned Materwala, Davor Svetinović
Maximal Extractable Value (MEV) poses significant threats to the security and fairness of Ethereum's decentralized finance ecosystem by enabling participants to exploit transaction ordering to extract profits at the expense of others. Heuristic-based detection methods have been widely adopted to identify MEV transactions such as sandwich, arbitrage, and liquidation. However, a lack of standardized evaluation across heuristics limits the ability to compare their detection behavior and computational characteristics. This paper presents a unified experimental framework to systematically evaluate the detection capabilities, agreement rates, and resource efficiency of existing heuristic approaches. An agreement metric is introduced to quantify consistency across detection methods. Additionally, we assessed resource utilization and execution time to evaluate computational scalability. Our empirical findings reveal that while these approaches exhibit scalability, their reliability, measured in terms of detection consistency, varies significantly across different MEV types. Agreement rates averaged 0.53 for sandwich detection, 0.40 for arbitrage, and 0.81 for liquidation, highlighting substantial differences in detection capabilities and heuristic formulations. These findings offer valuable insights into the practical challenges of achieving consistent MEV detection and highlight the need for developing more robust security countermeasures.
Gopal Ojha
The Ethereum Virtual Machine (EVM) is a stack-based virtual processor that executes smart contract bytecode sequentially. While this design ensures determinism and correctness, it inherently limits instruction throughput. This paper presents a feasibility study of instruction-level pipelining within the EVM interpreter architecture. By analyzing the internal execution flow of the EVM as implemented in the Go-Ethereum (geth) client, the study identifies the program counter dependency, particularly under jump instructions, as the principal control hazard preventing naïve pipelining. A two-stage pipelined execution model is proposed, separating opcode fetch and decode from execution and program counter update, with a feedback mechanism to preserve EVM semantics. The work focuses on architectural feasibility rather than performance evaluation and optimization, demonstrating that pipelining inside the EVM interpreter is conceptually possible under controlled synchronization. Limitations, design challenges, and future research directions are discussed.
Martin Perešíni
Bezpečnostné zlyhania blockchainových systémov zriedkavo vyplývajú z prelomenia kryptografie. Častejšie vznikajú z ekonomických stimulových nekompatibilít, chybných protokolových predpokladov a implementačných nedostatkov, ktoré môžu byť naprieč architektonickými vrstvami. Doterajší výskum prevažne analyzuje jednotlivé vrstvy blockchainov izolovane. Avšak takýto prístup nie vždy dokáže detegovať zraniteľnosti, ktoré sa môžu objavovať na hraniciach medzi jednotlivými vrstvami. Predkladaný výskum rieši túto poukázanú bezpečnostnú medzeru prostredníctvom systematickej medzivrstvovej analýzy založenej na bezpečnostnej referenčnej architektúre pre blockchainy. Použitá metodológia kombinuje modelovanie protokolov pomocou teórie hier, rozsiahle diskrétne a stochastické sieťové simulácie, návrh a prototypovanie protokolov, systematickú analýzu 36 kryptomenových peňaženiek a dôkazy s nulovou znalosťou typu zk-SNARK. Na vrstve konsenzu je formálne dokázané, že náhodný výber transakcií v protokoloch Proof-of-Work založených na orientovanom acyklickom grafe netvorí Nashovou rovnováhou. Simulácie s viac ako 8000 uzlami potvrdzujú, že táto zraniteľnosť pretrváva pri realistickom sieťovom rozsahu. Vyhodnotenie sebeckej ťažby s viacerými útočníkmi ukazuje, že prah ziskovosti v Nakamotovom konsenze klesá z 33% pri jednom útočníkovi na približne 14% až 17% pri piatich súčasných útočníkoch, a ukazuje, že Strongchain je konzistentne najodolnejší protokol vo všetkých testovaných konfiguráciách. Na rozhraní medzi konsenzom a sieťovou vrstvou dosahuje protokol Proof-of-Stake s integrovaným cibuľovým smerovaním anonymizáciu navrhovateľa blokov pri priepustnosti približne 110 transakcií za sekundu. Na aplikačnej vrstve formálna taxonómia autentifikácie odhaľuje, že väčšina analyzovaných kryptomenových peňaženiek poskytuje iba jednofaktorovú autorizáciu overovanú blockchainom napriek zdanlivej zložitosti ich rozhrania. Architektúra synchronizácie založená na zk-SNARK znižuje nároky mobilného klienta na úložisko zo 71MB na 3,5MB a nahrádza dôveru v servery tretích strán kryptografickou verifikáciou. Tieto závery a vykonaný výskum spoločne preukazujú, že bezpečnosť blockchainov je vo svojej podstate medzivrstvová vlastnosť, a zároveň poskytujú analytické nástroje, empirické referenčné hodnoty, protokolové mechanizmy a kryptografické návrhy pre budovanie odolnejších decentralizovaných systémov.