🦒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 230 of 355

Clear filters
Jan 1, 2021·PRIKLADNAYa DISKRETNAYa MATEMATIKA
2 cites
GROUP AUTHENTICATION SCHEME BASED ON ZERO-KNOWLEDGE PROOF

E. A. Shliakhtina, Dennis Gamayunov

In this paper, we address the problem of mutual authentication in user groups in decentralized messaging systems without trusted third party. We propose a mutual authentication algorithm for groups using zero-knowledge proof. Using the algorithm, which is based on trust chains existing in decentralized network, users are able to authenticate each other without establishing a shared secret over side channel. The proposed algorithm is based on Democratic Group Signature protocol (DGS) and Communication-Computation Efficient Group Key algorithm for large and dynamic groups (CCEGK). We have performed security analysis of the proposed mutual authentication scheme against several attacks including Sybil attack and have made complexity estimation for the algorithm. The algorithm is implemented in an experimental P2P group messaging application, and using this implementation we estimate overhead of the authentication scheme and convergence time for several initial configurations of user groups and trust chains.

Security in Wireless Sensor Networks
Cryptography and Data Security
Advanced Authentication Protocols Security
Original source
Jan 1, 2021·San Jose State University Scholar Works (San Jose State University)
2 cites
Bibliometric survey on Zero-Knowledge Proof for Authentication

Adwait Pathak, Tejas Patil, Shubham Pawar, Piyush Raut · 6 authors

Background: Zero Knowledge Proof is a persuasive cryptographic protocol employed to provide data security by keeping the user's identity, using the services anonymously. Zero Knowledge Proof can be the preferred option to use in multiple circumstances. Instead of using the public key cryptographic protocols, the zero-knowledge proof usage does not expose or leak confidential data or information during the transmission. Zero Knowledge Proof protocols are comparatively lightweight; this results in making it efficient in terms of memory. Zero Knowledge Proof applications can reside in authentication, identity management, cryptocurrency transactions, and many more. Traditional authentication schemes are vulnerable to attacks like password attacks, man-in-the-middle, replay attack, etc. while data transmission takes place over the network. Hence, there is a high need for developing an authentication scheme that does not leak the confidential information and provides authentication without disclosing the identity. Conclusion: In this paper the bibliometric study of Zero Knowledge Proof for Authentication is performed by using data extracted from the Scopus database. Observations are made based on this study that the maximum research publications on Zero Knowledge Proof for Authentication are from China, United States and India respectively. The conclusion of the paper is drawn that this specific research field is latest and research work in the coming years is necessary on Zero Knowledge Proof for Authentication.

Cryptography and Data Security
Original source
Jan 1, 2021·Lecture notes in computer science
4 cites
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs

Xiao Liang, Omkant Pandey

General-purpose zero-knowledge proofs for all \(\mathsf {NP} \) languages greatly simplify secure protocol design. However, they inherently require the code of the underlying relation. If the relation contains black-box calls to a cryptographic function, the code of that function must be known to use the ZK proof, even if both the relation and the proof require only black-box access to the function. Rosulek (Crypto’12) shows that non-trivial proofs for even simple statements, such as membership in the range of a one-way function, require non-black-box access.

2 source records
Cryptography and Data Security
Cryptographic Implementations and Security
Advanced Authentication Protocols Security
Original source
Jan 1, 2021·IEEE Transactions on Information Forensics and Security
4 cites
Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs

Dimitris Mouris, Nektarios Georgios Tsoutsos

As cloud computing becomes more popular, research has focused on usable solutions to the problem of verifiable computation (VC), where a computationally weak device (Verifier) outsources a program execution to a powerful server (Prover) and receives guarantees that the execution was performed faithfully. A Prover can further demonstrate knowledge of a secret input that causes the Verifier’s program to satisfy certain assertions, without ever revealing which input was used. State-of-the-artZero-KnowledgeProofs of Knowledge (ZKPK) methods encode a computation using arithmetic circuits and preserve the privacy of Prover’s inputs while attesting the integrity of program execution. Nevertheless, developing, debugging, and optimizing programs as circuits remains a daunting task, as most users are unfamiliar with this programming paradigm. In this work, we present Zilch, a framework that accelerates and simplifies the deployment of VC and ZKPK for any applicationtransparently, i.e., without the need of trusted setup. Zilch uses traditional instruction sequences rather than static arithmetic circuits that would need to be regenerated for each different computation. Towards that end, we have implemented Z MIPS: a MIPS-like processor model that allows verifying each instruction independently and compose a proof for the execution of the target application. To foster usability, Zilch incorporates a novel cross-compiler from an object-oriented Java-like language tailored to ZKPK and optimized our Z MIPS model, as well as a powerful API that enables integration of ZKPK within existing C/C++ programs. In our experiments, we demonstrate the flexibility of Zilch using two real-life applications, and evaluate Prover and Verifier performance on a variety of benchmarks.

Cryptography and Data Security
Security and Verification in Computing
Cloud Data Security Solutions
Original source
Jan 1, 2021·Lecture notes in networks and systems
3 cites
Review on Zero-Knowledge Proof Method

Maanas Midha, Amit Kumar Gupta‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬‬, Priya Mathur

No abstract is available for this record.

Cryptography and Data Security
Cryptographic Implementations and Security
Chaos-based Image/Signal Encryption
Original source
Jan 1, 2021·Lecture notes in computer science
8 cites
Shorter Lattice-Based Zero-Knowledge Proofs for the Correctness of a Shuffle

Javier Herranz, Ramiro Pinilla, Manuel Sánchez-Raya

In an electronic voting procedure, mixing networks are used to ensure anonymity of the casted votes. Each node of the network re-encrypts the input list of ciphertexts and randomly permutes it in a process named shuffle, and must prove (in zero-knowledge) that the process was applied honestly. To maintain security of such a process in a post-quantum scenario, new proofs are based on different mathematical assumptions, such as lattice-based problems. Nonetheless, the best lattice-based protocols to ensure verifiable shuffling have linear communication complexity on N, the number of shuffled ciphertexts.

Open access
2 source records
Cryptography and Data Security
Internet Traffic Analysis and Secure E-voting
Cryptographic Implementations and Security
Original source