Follow blockchain research across journals, conferences, and preprint repositories.
8,503 results · page 213 of 355
Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, Ivan Visconti
No abstract is available for this record.
Jonathan Bootle, Alessandro Chiesa, Siqi Liu
No abstract is available for this record.
Yao Liu, Zhonghao Yuan, Yunhan Hu
No abstract is available for this record.
Sungwook Kim, Hyeonbum Lee, Jae Hong Seo
No abstract is available for this record.
Abhiram Kothapalli, Srinath Setty, Ioanna Tzialla
No abstract is available for this record.
Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede
No abstract is available for this record.
Xavier Arnal, Abraham Cano, Tamara Finogina, Javier Herranz
No abstract is available for this record.
VILMA MATTILA, PRATEEK DWIVEDI, PRATIK GAURI, DHANRAJ DADHICH
Since public blockchains are permissionless, it is subject to passive adversarial attack. In 5irechain we have addressed the security problem related to this passive adversarial activity by applying 5ireHE, a homomorphic encryption technique that encrypts the transactional details using the receiver’s public key. Since the transaction is encrypted by the receiver’s public key, it is harder for other validators to validate the transaction in 5ire. In this paper, we introduce ZKP for validating the transaction in a sense that validator can check if the sender’s previous balance and the remaining balance are in harmony with the amount of the transaction despite the difference in public keys that are used for the encryption of transaction and the encryption of account balance.
Han Liu, Dezhi Han
No abstract is available for this record.
Kenneth A. Bamberger
Individuals who wish to access a website or qualify for a loan are expected to expose personally identifying information, undermining their privacy and security. Firms share proprietary information in dealmaking negotiations which, if the deal fails, may be used by the negotiating partner for a competitive advantage. Regulators are expected to disclose their algorithmic tools to comply with public transparency and oversight requirements, a practice that risks rendering these tools circumventable and ineffective. Litigants might have to reveal trade secrets in court proceedings to prove a claim or defense. Such “verification dilemmas” — costly choices between opportunities that require the verification of some fact and risks of exposing sensitive information in order to perform that verification — appear across the legal landscape. Yet existing legal responses to them are imperfect. Legal responses often depend on ex post litigation procedures that can be prohibitively expensive for those most in need or are otherwise ineffective. Zero-knowledge proofs (ZKPs) — a class of cryptographic protocols that enables verification of a fact or characteristic of secret information without learning the actual secret — can help to avoid these verification dilemmas. ZKPs can provide a feasible means for a party who holds secret information to demonstrate desirable properties of this information while keeping the information otherwise hidden. Yet ZKPs have received scant notice in the legal literature. This Article fills that gap by providing the first deep dive into ZKPs’ broad relevance for law. It explains ZKPs’ conceptual power and technical operation to a legal audience. It then demonstrates how ZKPs can be applied as a governance tool to transform verification dilemmas in multiple legal contexts. Finally, the Article surfaces and provides a framework to address the policy issues implicated by introducing of ZKP governance tools into existing law and practice.
Maoguang Wang, Tianming Wang, Haoyue Ji
No abstract is available for this record.
Surya Bhushan Kumar, Ranjan Kumar Mandal, Kuntal Mukherjee, Rajiv Kumar Dwivedi
No abstract is available for this record.
Ruizhong Du, Xiaoya Li, Yan Liu
No abstract is available for this record.
Zheng Lijuan, Li Dunyue, Zhang Rui, Zhao Yong-bin · 6 authors
No abstract is available for this record.
Sunil Anasuri, Guru Pramod Rusum, kiran Kumar Pappula
The emergence of decentralized applications (dApps) has posed a challenge to the current identity management system, which is often centralized authority, mostly exposed to security breaches, information silos, and poor control of users. Blockchain technology introduces a disruptive technology with its decentralized, transparent and tamper-proof architecture, which can usher in new solutions to digital identity. The paper is an investigation of blockchain-based identity management systems, their architecture, working life cycle and dApp integration with identity management solutions. It explores three prominent identity frameworks, centralized, federated, and self-sovereign identity (SSI), and puts blockchain in the group of the very drivers of user-centric and verifiable identity resolutions. The analysis of smart contracts applied to identity operations, consensus mechanisms used in establishing trust, and numerous security and privacy improvements, such as zero-knowledge proofs, is discussed. The potential of blockchain-based identity can be seen in terms of its use in real-world business processes in the areas of decentralized finance (DeFi), healthcare data sharing, and supply chain management. Moreover, the document argues about the use of interoperability mechanisms like Decentralized Identifiers (DIDs) or Verifiable Credentials (VCs), and covers the most important points of scalability, compliance considerations, and trans-chain identity management. The future research directions, such as AI-powered verification, quantum-resistant protocols, or wider ecosystem adoption, are discussed as well. The research behind this project aims to provide a detailed background for scholars and practitioners who wish to implement safe, productive, and privacy-protected identity management in decentralised digital environments
Makoto Nakamura, Takeshi Miyamae, Masanobu Morinaga
We propose a privacy-preserving scheme to outsource zero-knowledge proof generation to a party that we call a worker. Our scheme can be applied to zk-SNARKs with a trusted setup, zero-knowledge proofs deployed in many applications. Compared to known privacy-preserving outsourcing schemes, our scheme is more practical in the sense that the computational and memory load on the worker is almost the same as that on the prover in cases where the provers generate proofs on their own.
Nadav Voloch, Maor Meir Hajaj
No abstract is available for this record.
Yu Zhou, Zeming Wei, Shansi Ma, Tang Hua
No abstract is available for this record.
Hao Guo, Jieren Cheng, Janghao Wang, Tao Chen · 7 authors
No abstract is available for this record.
Yuyu Wang, Jiaxin Pan
No abstract is available for this record.
Yuichi Komano, Takaaki Mizuki
No abstract is available for this record.
Cvetkovski, Oliver, Field, Carlo, Trinchi, Davide, Marti, Christof · 5 authors
Domain-specific Microservice Reference Architectures (MSRA) have become relevant study objects in software technology. They facilitate the technical evaluation of service designs, compositions patterns and deployment configurations in realistic operational practice. Current knowledge about MSRA is predominantly confined to business domains with modest numbers of users per application. Due to the ongoing massive digital transformation of society, people-related online services in e-government, e-health and similar domains must be designed to be highly scalable at entire nation level at affordable infrastructure cost. With ZVAX, we present such a service in the e-health domain. Specifically, the ZVAX implementation adheres to an MSRA for pandemic-related processes such as vaccination registration and passenger locator form submission, with emphasis on selectable levels of privacy. We argue that ZVAX is valuable as study object for the training of software engineers and for the debate on arbitrary government-to-people services at scale.
Nitin Singh, Pankaj Dayama, Vinayaka Pandit
No abstract is available for this record.
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Schöll
Zero-knowledge proof systems are usually designed to support computations for circuits over $$\mathbb {F}_2$$ or $$\mathbb {F}_p$$ for large p, but not for computations over $$\mathbb {Z}_{2^k}$$ , which all modern CPUs operate on. Although $$\mathbb {Z}_{2^k}$$ -arithmetic can be emulated using prime moduli, this comes with an unavoidable overhead. Recently, Baum et al. (CCS 2021) suggested a candidate construction for a designated-verifier zero-knowledge proof system that natively runs over $$\mathbb {Z}_{2^k}$$ . Unfortunately, their construction requires preprocessed random vector oblivious linear evaluation (VOLE) to be instantiated over $$\mathbb {Z}_{2^k}$$ . Currently, it is not known how to efficiently generate such random VOLE in large quantities. In this work, we present a maliciously secure, VOLE extension protocol that can turn a short seed-VOLE over $$\mathbb {Z}_{2^k}$$ into a much longer, pseudorandom VOLE over the same ring. Our construction borrows ideas from recent protocols over finite fields, which we non-trivially adapt to work over $$\mathbb {Z}_{2^k}$$ . Moreover, we show that the approach taken by the QuickSilver zero-knowledge proof system (Yang et al. CCS 2021) can be generalized to support computations over $$\mathbb {Z}_{2^k}$$ . This new VOLE-based proof system, which we call QuarkSilver, yields better efficiency than the previous zero-knowledge protocols suggested by Baum et al. Furthermore, we implement both our VOLE extension and our zero-knowledge proof system, and show that they can generate 13–50 million VOLEs per second for $${64}\,{\textrm{bit}}$$ to $${256}\,{\textrm{bit}}$$ rings, and evaluate $${1.3}\,\textrm{million}$$ $${64}\,{\textrm{bit}}$$ multiplications per second in zero-knowledge.