Search
Search Results
-
An efficient quantum non-interactive zero knowledge proof for confidential transaction and quantum range proof
This paper investigated the Bitcoin blockchain and other crypto currencies confidential transaction techniques for cryptographic commitment in a...
-
-
A Resolution-Based Interactive Proof System for UNSAT
Modern SAT or QBF solvers are expected to produce correctness certificates. However, certificates have worst-case exponential size (unless...
-
Efficient Non-interactive Zero-Knowledge Proof for Graph 3-Coloring Problem
Zero-knowledge proof (ZKP) has a crucial role in the construction of cryptographic protocols and privacy protection. One of the core research...
-
A Generic Transform from Multi-round Interactive Proof to NIZK
We present a new generic transform that takes a multi-round interactive proof for the membership of a language...
-
Proof Mate: An Interactive Proof Helper for PVS (Tool Paper)
This paper presents Proof Mate, an interactive proof helper for the PVS verification system. The helper is integrated in VSCode-PVS, the Visual...
-
Learning Proof Transformations and Its Applications in Interactive Theorem Proving
Interactive theorem provers are today increasingly used to certify mathematical theories. To formally prove a theorem, reasoning procedures called...
-
Non-interactive SM2 threshold signature scheme with identifiable abort
A threshold signature is a special digital signature in which the N -signer share the private key x and can construct a valid signature for any subset...
-
BCTPV-NIZK: Publicly-Verifiable Non-interactive Zero-Knowledge Proof System from Minimal Blockchain Assumptions
Non-interactive publicly-verifiable zero-knowledge proofs (PV-NIZKs) are essential to modern cryptography. However, historically, literature has used...
-
SNACKs for Proof-of-Space Blockchains
SNACKs are succinct non-interactive arguments of chain knowledge. They allow for efficient and generic solutions to blockchain light-client...
-
Succinct Non-Interactive Arguments via Linear Interactive Proofs
Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification....
-
A zero-knowledge proof of transpose of a matrix of finite field elements
Interactive zero-knowledge arguments for some fundamental linear algebraic operations have been formulated. But those arguments cannot be used for...
-
Interactive Matching Logic Proofs in Coq
Matching logic (ML) is a formalism for specifying and reasoning about mathematical structures by means of patterns and pattern matching. Previously,...
-
Evonne: Interactive Proof Visualization for Description Logics (System Description)
Explanations for description logic (DL) entailments provide important support for the maintenance of large ontologies. The “justifications” usually...
-
Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version)
The celebrated Fiat–Shamir transformation turns any public-coin interactive proof into a non-interactive one, which inherits the main security...
-
Zero-Knowledge Proof
Zero-knowledge proofs are techniques to verify claims without revealing the information itself. In this process, a “prover” shares proof of their...
-
Non-interactive Zero-Knowledge from Non-interactive Batch Arguments
Zero-knowledge and succinctness are two important properties that arise in the study of non-interactive arguments. Previously, Kitagawa et al. (TCC...
-
Enhancing security in Fiat–Shamir transformation-based non-interactive zero-knowledge protocols for IoT authentication
With the rapid expansion of IoT devices and their applications, there is an increasing demand for efficient and secure authentication mechanisms to...
-
Towards explainable interactive multiobjective optimization: R-XIMO
In interactive multiobjective optimization methods, the preferences of a decision maker are incorporated in a solution process to find solutions of...
-
Trocq: Proof Transfer for Free, With or Without Univalence
This article presents Trocq, a new proof transfer framework for dependent type theory. Trocq is based on a novel formulation of type equivalence,...