Classical zero-knowledge arguments for quantum computations [PDF]
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers.
Thomas Vidick, Tina Zhang
doaj +1 more source
Polynomial Commitment-Based Zero-Knowledge Proof Schemes: A Brief Review
Blockchain technology is one of the most popular information technologies at present, and its security features are realized through various cryptographic tools.
Mundele, Becky, Han, Chenchen
core +1 more source
+HomElG Zero-knowledge Proof Protocol for Privacy Protection of Consortium Blockchain Transfer
In order to solve the problems of imperfect transaction legitimacy verification strategies for protecting account balances and transaction amounts in privacy protection of consortium blockchain, and the low efficiency of the basic encryption algorithm ...
Xu JING, Shaokun YANG
doaj
ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost [PDF]
The decentralization of blockchain can easily lead to the leakage of users’ private data at the transaction layer,which in turn leads to information security issues.The zero-knowledge range proof is designed to confidentially verify that the transaction ...
LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
doaj +1 more source
Zero-Knowledge Proof of Knowledge for Peg Solitaire [PDF]
Peg solitaire is a very popular traditional single-player board game, known to be NP-complete. In this paper, we present a zero-knowledge proof of knowledge for solutions of peg solitaire instances. Our proof is straightforward, in the sense that it does
Bultel, Xavier
core +1 more source
Zero Knowledge Proof for verifiable and anonymous voting
openL'obiettivo di questo progetto è studiare la fattibilità e sviluppare un Proof of Concept (POC) per una piattaforma di voto verificabile ma anonima utilizzando la Zero-Knowledge Proof (ZKP).
LAURIOLA, PIETRO
core
Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof [PDF]
We present a new succinct zero knowledge argument scheme for layered arithmetic circuits without trusted setup. The prover time is $O(C + n \log n)$ and the proof size is $O(D \log C + \log^2 n)$ for a $D$-depth circuit with $n$ inputs and $C$ gates. The
Tiancheng Xie +3 more
core +1 more source
Privacy-preserving location authentication for low-altitude UAVs: A blockchain-based approach
Efficient and trusted regulation of unmanned aerial vehicles (UAVs) is an essential but challenging issue in the future era of the Internet of Low-altitude Intelligence, due to the difficulties in UAVs’ identity recognition and location matching ...
Pan Hengchang +5 more
doaj +1 more source
A Self-Sovereign Identity Based on Zero-Knowledge Proof and Blockchain
Systems for generating and managing digital identities are in the process of being transformed to improve data sharing security and increase decentralization.
Mohameden Dieye +6 more
doaj +1 more source
Comparison the efficiency of related zero-knowledge proof schemes.
Comparison the efficiency of related zero-knowledge proof schemes.
Faguo Wu (3337191) +3 more
core +1 more source

