Follow blockchain research across journals, conferences, and preprint repositories.
8,503 results · page 195 of 355
Nimish Mishra, S. K. Hafizul Islam
No abstract is available for this record.
Andrea Basso, Giulio Codogni, Deirdre Connolly, Luca De Feo · 10 authors
No abstract is available for this record.
Haohua Duan, Liyao Xiang, Xinbing Wang, Pengzhi Chu · 5 authors
Verifying the correctness of computation without revealing the input is a critical issue intensively studied in real-world applications. The recent surge of zero knowledge arguments has been focusing on its efficiency and practicality. Among them, GKR-based arguments have received wide attention and become the foundation of many zero-knowledge proof protocols. However, GKR-based protocols are restricted to layered arithmetic circuits. We proposeTerrace, a new, efficient zero-knowledge argument system for general circuits, based on GKR. By dynamically patching cross-layer claims to the original circuit for verification instead of verifying those claims separately,Terraceis able to reduce the total circuit size and thus enjoys a logarithmic factor less verification time and proof size.Terraceis further extended to include the verification of non-arithmetic operations by rewriting those claims in the multilinear extension form. Experimental results demonstrate that Terrace enjoys a competitive performance on efficiency, and shows great promise in enabling low-cost verification of neural networks.
Vitalik Buterin, Jacob Illum, Matthias Nadler, Fabian Schär · 5 authors
We study Privacy Pools, a novel smart contract-based privacy-enhancing protocol. The protocol introduces a mechanism for users to reveal certain properties of their transaction without having to reveal the transaction itself. The core concept involves allowing users to publish a zero-knowledge proof, demonstrating that their funds (do not) originate from known (un-)lawful sources, without publicly revealing their entire transaction history. This is achieved by proving membership in custom association sets, which are designed to demonstrate compliance with regulatory frameworks or social consensus. We illustrate how this mechanism can create a separating equilibrium between compliant and non-compliant withdrawals. Our work describes the technical underpinnings, incentives and broader implications of this mechanism, highlighting how Privacy Pools-like protocols can create more private yet compliant blockchain transactions.
Mehmet Sabır Kiraz, Enrique Larraia, Owen Vaughan
No abstract is available for this record.
Shahla Atapoor, Karim Baghery, Daniele Cozzo, Robi Pedersen
No abstract is available for this record.
Anton Dziatkovskii
The article is devoted to technologies of digitalization of educationzero-knowledge proof, blockchain and artificial intelligence.It analyzes the features of these technologies and lists possible uses in terms of the public good.
Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar
No abstract is available for this record.
Yijing Lin, Hongyang Du, Dusit Niyato, Jiangtian Nie · 7 authors
The construction of virtual transportation networks requires massive data to be transmitted from edge devices to Virtual Service Providers (VSP) to facilitate circulations between the physical and virtual domains in Metaverse. Leveraging semantic communication for reducing information redundancy, VSPs can receive semantic data from edge devices to provide varied services through advanced techniques, e.g., AI-Generated Content (AIGC), for users to explore digital worlds. But the use of semantic communication raises a security issue because attackers could send malicious semantic data with similar semantic information but different desired content to break Metaverse services and cause wrong output of AIGC. Therefore, in this paper, we first propose a blockchain-aided semantic communication framework for AIGC services in virtual transportation networks to facilitate interactions of the physical and virtual domains among VSPs and edge devices. We illustrate a training-based targeted semantic attack scheme to generate adversarial semantic data by various loss functions. We also design a semantic defense scheme that uses the blockchain and zero-knowledge proofs to tell the difference between the semantic similarities of adversarial and authentic semantic data and to check the authenticity of semantic data transformations. Simulation results show that the proposed defense method can reduce the semantic similarity of the adversarial semantic data and the authentic ones by up to 30% compared with the attack scheme.
Jeffrey Champion, David J. Wu
No abstract is available for this record.
Matthew Green, Mathias Hall-Andersen, Eric Hennenfent, Gabriel Kaptchuk · 6 authors
We consider the problem of proving in zero-knowledge the existence of vulnerabilities in executables compiled to run on real-world processors. We demonstrate that it is practical to prove knowledge of real exploits for real-world processor architectures without the need for source code and without limiting our consideration to narrow vulnerability classes. To achieve this, we devise a novel circuit compiler and a toolchain that produces highly optimized, non-interactive zero-knowledge proofs for programs executed on the MSP430, an ISA commonly used in embedded hardware. Our toolchain employs a highly optimized circuit compiler and a number of novel optimizations to construct efficient proofs for program binaries. To demonstrate the capability of our system, we test our toolchain by constructing proofs for challenges in the Microcorruption capture the flag exercises.
Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj
No abstract is available for this record.
Huayi Qi, Ye Cheng, Minghui Xu, Dongxiao Yu · 6 authors
Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK) is a practical zero-knowledge proof system for Rank-1 Constraint Satisfaction (R1CS), enabling privacy preservation and addressing the previous scalability concerns on zero-knowledge proofs. Existing constructions of zk-SNARKs require huge memory overhead to generate proofs in that the size of the zk-SNARK circuit can be large even for a very simple use case, which limits the applications for regular resource-constrained users. To reduce the memory utilization of zk-SNARKs, this paper presents a hash-based method “Split”. Concretely, Split intends to partition the zk-SNARK circuits so that components can be processed sequentially while ensuring strong security properties leveraging hash circuits. As a zk-SNARK circuit is partitioned, obsolete variables are no longer preserved in the memory. We further propose an enhanced Split as$n$-Split, which leads to better optimization by properly choosing multiple splits. Our experimental results validate the effectiveness and efficiency of Split in conserving memory usage for resource-constrained provers as long as the circuit can be partitioned to a Good Split, indicating that via Split zk-SNARKs can be brought one step closer to practical applications.
Lorenzo Grassi, Yonglin Hao, Christian Rechberger, Markus Schofnegger · 6 authors
No abstract is available for this record.
Amalan Joseph Antony, Kunwar P. Singh
Interactive zero-knowledge arguments for some fundamental linear algebraic operations have been formulated. Using those proofs for operations involving vectors or matrices requires certain reductions and additional communication rounds. In this paper, we explore the possibility of using various principles of discrete mathematics to formulate a method for a prover to securely prove to the verifier that he knows the sum of all the elements of a matrix, while both the sum and the original matrix remain unknown to the verifier.
Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß · 7 authors
We present a new method for transforming zero-knowledge protocols in the designated verifier setting into public-coin protocols, which can be made non-interactive and publicly verifiable. Our transformation applies to a large class of ZK protocols based on oblivious transfer. In particular, we show that it can be applied to recent, fast protocols based on vector oblivious linear evaluation (VOLE), with a technique we call VOLE-in-the-head, upgrading these protocols to support public verifiability. Our resulting ZK protocols have linear proof size, and are simpler, smaller and faster than related approaches based on MPC-in-the-head. To build VOLE-in-the-head while supporting both binary circuits and large finite fields, we develop several new technical tools. One of these is a new proof of security for the SoftSpokenOT protocol (Crypto 2022), which generalizes it to produce certain types of VOLE correlations over large fields. Secondly, we present a new ZK protocol that is tailored to take advantage of this form of VOLE, which leads to a publicly verifiable VOLE-in-the-head protocol with only 2x more communication than the best, designated-verifier VOLE-based protocols. We analyze the soundness of our approach when made non-interactive using the Fiat-Shamir transform, using round-by-round soundness. As an application of the resulting NIZK, we present $$\textsf{FAEST}$$ , a post-quantum signature scheme based on AES. FAEST is the first AES-based signature scheme to be smaller than SPHINCS+, with signature sizes between 5.6 and 6.6kB at the 128-bit security level. Compared with the smallest version of SPHINCS+ (7.9kB), FAEST verification is slower, but the signing times are between 8x and 40x faster.
Emanuele Scala, Changyu Dong, Flavio Corradini, Leonardo Mostarda
No abstract is available for this record.
Gongxian Zeng, Junzuo Lai, Zhengan Huang, Linru Zhang · 8 authors
No abstract is available for this record.
Duhyeong Kim, Dongwon Lee, Jinyeong Seo, Yongsoo Song
No abstract is available for this record.
Muhammad Fadhil Abidin, Avinanta Tarigan, Lely Prananingrum
Blockchain merupakan sistem terdesentralisasi yang terbuka yang dapat dimanfaatkan untuk melakukan pelacakan dan verifikasi keaslian dokumen. Sifat keterbukaan tersebut menjadi masalah jika isi dari dokumen bersifat rahasia atau dilindungi oleh undang-undang perlindungan data pribadi. Dalam penelitian ini, sebuah sistem verifikasi dokumen berbasis Blockchain dirancang dengan memanfaatkan algoritma ZKP (Zero Knowledge Proof) yang diimplementasikan dalam sebuah Smart Contract pada jaringan Blockchain Polygon. Algoritma ZKP melindungi informasi yang bersifat rahasia tetapi dapat diverifikasi kebenaran dan keasliannya oleh pihak yang berkepentinga tanpa menguak informasi tersebut. Penelitian ini melibatkan perancangan smart contract yang terdiri dari fungsi-fungsi untuk mengatur proses verifikasi dokumen, serta implementasi sistem verifikasi dokumen yang terintegrasi dengan Smart Contract. Hasil penelitian menunjukkan bahwa sistem yang dibangun dapat meningkatkan keamanan proses pelacakan dokumen dengan tidak menguak isi dokumen yang bersifat rahasia dan dilindungi oleh undang-undang.
Gweonho Jeong, Nuri Lee, Jihye Kim, Hyunok Oh
With the rapid growth of the blockchain market, privacy and security issues for digital assets are becoming more important. In the most widely used public blockchains, such as Bitcoin and Ethereum, all activities on user accounts are publicly disclosed, which violates privacy regulations such as EU GDPR. Encryption of accounts and transactions may protect privacy, but it also raises issues of validity and transparency. While encrypted information can protect privacy, it cannot alone verify the validity of a transaction. Additionally, encryption makes it difficult to meet anti-money laundering regulations, such as auditability. In this paper, we propose${\sf Azeroth}$, an auditable zero-knowledge transfer framework.${\sf Azeroth}$connects a zero-knowledge proof to an encrypted transaction, enabling it to check its validation while protecting its privacy.${\sf Azeroth}$also allows authorized auditors to audit transactions.${\sf Azeroth}$is designed as a smart contract for flexible deployment on existing blockchains. We implement the${\sf Azeroth}$smart contract, and execute it on various platforms including an Ethereum testnet blockchain, and measure the time to show the practicality of our proposal. The end-to-end latency of a privacy-preserving transfer takes about$4.4s$. In particular, the client’s transaction generation time with a proof only takes about$0.9s$. The security of${\sf Azeroth}$is proven under the cryptographic assumptions.
AoXuan Li, Gabriele D’Angelo, Su-Kit Tang
No abstract is available for this record.
Nicholas Dominic, Naufal Rizqi Pratama, Kenny Cornelius, Shavellin Herliman Senewe · 5 authors
No abstract is available for this record.
Ayman Nait Cherif, Youssef Achir, Mohamed Youssfi, Mohamed Youssfi · 6 authors
Abstract—This paper investigates the integration of Zero-Knowledge Proofs (ZKP) and OAuth 2.0 to enhance anonymity and security in multi-agent distributed systems. We propose an approach that allows agents to authenticate and prove possession of specific data without revealing the underlying details. Additionally, we outline a potential access control strategy using ZKP for anonymity, allowing agents to validate their access rights without identity exposure. When combined with OAuth 2.0, this mechanism provides a framework for secure data access. While the proposed methods offer promising solutions to security, privacy, and anonymity challenges in multi-agent systems, they also highlight the need for further research and validation to confirm their effectiveness.