🦒Web3Research

Blockchain Papers

Follow blockchain research across journals, conferences, and preprint repositories.

8,503 papersLast indexed Aug 31, 2026
Search papers
All timeDailyWeeklyMonthly Open access
TopicsBlockchainBitcoinEthereumSmart contractCryptocurrencyDecentralized financeZero knowledge proofWeb3

Paper index

8,503 results ¡ page 254 of 355

Clear filters
Jan 1, 2019¡DR-NTU (Nanyang Technological University)
0 cites
Channelized coinShuffle++ : practical unlinkability in the ethereum blockchain

Xiong, Luoyuan

Strong anonymity and transaction privacy for cryptocurrencies that build on top of a permissionless blockchain is a well-known hard problem. The duplication of ledger provides public verifiability while also give rise to deanonymization attacks and unlinkability violations, where users’ real world identities are linked to their
\npseudonymous blockchain accounts. Even though some recently proposed protocols that utilize Ring Signatures [1] or Zero Knowledge Proof [2] have effectively mitigated those attacks, the computational overhead and monetary cost that comes along
\nwith those fancy cryptographic primitives render them less usable, which arguably contribute to their poor adoption.
\nIn this work, we proposed a practical, peer-to-peer, coin mixing protocol in the Ethereum blockchain that significantly enhance transaction privacy and bring back the unlinkability property. The protocol is primarily inspired by CoinShuffle++ [3] and Generalized State Channel [4], and it enables secure, accountable and
\nincentive-compatible shuffling while only requires very weak trust assumption, minimal cost and negligible delay.
\nA complete system specification and theoretical evaluation will be provided while the actual experimental the result will appear in a future update once an end-to-end Proof of Concept is built.

Blockchain Technology Applications and Security
Cryptography and Data Security
Internet Traffic Analysis and Secure E-voting
Original source
Jan 1, 2019¡Frontiers in Blockchain
80 cites
Digital Identity and the Blockchain: Universal Identity Management and the Concept of the “Self-Sovereign” Individual

Andrej Zwitter, Oskar Josef Gstrein, Evan Yap

While ‘classical’ human identity has kept philosophers busy since millennia, ‘Digital Identity’ seems primarily machine related. Telephone numbers, E-Mail inboxes, or Internet Protocol (IP)-addresses are irrelevant to define us as human beings at first glance. However, with the omnipresence of digital space the digital aspects of identity gain importance. In this submission, we aim to put recent developments in context and provide a categorization to frame the landscape as developments proceed rapidly. First, we present selected philosophical perspectives on identity. Secondly, we explore how the legal landscape is approaching identity from a traditional dogmatic perspective both in national and international law. After blending the insights from those sections together in a third step, we will go on to describe and discuss current developments that are driven by the emergence of new tools such as ‘Distributed Ledger Technology’ and ‘Zero Knowledge Proof’. One of our main findings is that the management of digital identity is transforming from a purpose driven necessity towards a self-standing activity that becomes a resource for many digital applications. In other words, whereas traditionally identity is addressed in a predominantly sectoral fashion whenever necessary, new technologies transform digital identity management into a basic infrastructural service, sometimes even a commodity. This coincides with a trend to take the ‘control’ over identity away from governmental institutions and corporate actors to ‘self-sovereign individuals’, who have now the opportunity to manage their digital self autonomously. To make our conceptual statements more relevant, we present several already existing use cases in the public and private sector. Subsequently, we discuss potential risks that should be mitigated in order to create a desirable relationship between the individual, public institutions, and the private sector in a world where self-sovereign identity management has become the norm. We will illustrate these issues along the discussion around privacy, as well as the development of backup mechanisms for digital identities. Despite the undeniable potential for the management of identity, we suggest that particularly at this point in time there is a clear need to make detailed (non-technological) governance decisions impacting the general design and implementation of self-sovereign identity systems.

Open access
3 source records
Blockchain Technology Applications and Security
Privacy, Security, and Data Protection
Cybersecurity and Cyber Warfare Studies
Original source
Jan 1, 2019¡Lecture notes in computer science
13 cites
Publicly Verifiable Proofs from Blockchains

Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti

No abstract is available for this record.

Cryptography and Data Security
Blockchain Technology Applications and Security
Cloud Data Security Solutions
Original source
Jan 1, 2019¡Lecture notes in computer science
241 cites
Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup

Srinath Setty

This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP-complete language that generalizes arithmetic circuit satisfiability. A distinctive feature of Spartan is that it offers the first zkSNARKs without trusted setup (i.e., transparent zkSNARKs) for NP where verifying a proof incurs sub-linear costs—without requiring uniformity in the NP statement’s structure. Furthermore, Spartan offers zkSNARKs with a time-optimal prover, a property that has remained elusive for nearly all zkSNARKs in the literature.

2 source records
Cryptography and Data Security
Security and Verification in Computing
Distributed systems and fault tolerance
Original source
Jan 1, 2019¡Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT, 325-332, 2019, Prague, Czech Republic
18 cites
ZKlaims: Privacy-preserving Attribute-based Credentials using Non-interactive Zero-knowledge Techniques

Martin Schanzenbach, Thomas Kilian, Julian SchĂźtte, Christian Banse

In this paper we present ZKlaims: a system that allows users to present attribute-based credentials in a privacy-preserving way. We achieve a zero-knowledge property on the basis of Succinct Non-interactive Arguments of Knowledge (SNARKs). ZKlaims allow users to prove statements on credentials issued by trusted third parties. The credential contents are never revealed to the verifier as part of the proving process. Further, ZKlaims can be presented non-interactively, mitigating the need for interactive proofs between the user and the verifier. This allows ZKlaims to be exchanged via fully decentralized services and storages such as traditional peer-to-peer networks based on distributed hash tables (DHTs) or even blockchains. To show this, we include a performance evaluation of ZKlaims and show how it can be integrated in decentralized identity provider services.

Open access
2 source records
Cryptography and Data Security
Privacy-Preserving Technologies in Data
Access Control and Trust
Original source
Jan 1, 2019¡Lecture notes in computer science
17 cites
Shorter Quadratic QA-NIZK Proofs

Vanesa Daza, Alonso Gonzålez, Zaira Pindado, Carla Ràfols ¡ 5 authors

No abstract is available for this record.

Open access
Coding theory and cryptography
Cryptography and Data Security
Polynomial and algebraic computation
Original source
Jan 1, 2019¡Edinburgh Research Explorer (University of Edinburgh)
274 cites
Sonic

Mary Maller, Sean Bowe, Markulf Kohlweiss, Sarah Meiklejohn

Ever since their introduction, zero-knowledge proofs have become an important tool for addressing privacy and scalability concerns in a variety of applications. In many systems each client downloads and verifies every new proof, and so proofs must be small and cheap to verify. The most practical schemes require either a trusted setup, as in (pre-processing) zk-SNARKs, or verification complexity that scales linearly with the complexity of the relation, as in Bulletproofs. The structured reference strings required by most zkSNARK schemes can be constructed with multi-party computation protocols, but the resulting parameters are specific to an individual relation. Groth et al. discovered a zk-SNARK protocol with a universal structured reference string that is also updatable, but the string scales quadratically in the size of the supported relations.<br/> <br/>Here we describe a zero-knowledge SNARK, Sonic, which supports a universal and continually updatable structured reference string that scales linearly in size. We also describe a generally useful technique in which untrusted “helpers” can compute advice that allows batches of proofs to be verified more efficiently. Sonic proofs are constant size, and in the “helped” batch verification context the marginal cost of verification is comparable with the most efficient SNARKs in the literature<br/>

Open access
3 source records
Cryptography and Data Security
Cloud Data Security Solutions
Blockchain Technology Applications and Security
Original source
Jan 1, 2019¡Lecture notes in computer science
180 cites
Scalable Zero Knowledge with No Trusted Setup

Eli Ben‐Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev

No abstract is available for this record.

Cryptography and Data Security
Complexity and Algorithms in Graphs
Cryptographic Implementations and Security
Original source