Search
Search Results
-
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....
-
Non-interactive Zero-Knowledge Functional Proofs
In this paper, we consider to generalize NIZK by empowering a prover to share a witness in a fine-grained manner with verifiers. Roughly, the prover...
-
Non-interactive Universal Arguments
In 2002, Barak and Goldreich introduced the notion of a universal argument and constructed an interactive universal argument for non-deterministic...
-
Non-interactive Zero-Knowledge Proofs to Multiple Verifiers
In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n verifiers at a time efficiently. The proofs are...
-
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...
-
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...
-
Efficient Non-interactive Anonymous Communication
Methods for untraceable and anonymous communication, such as anonymous routing networks and dining cryptographers networks, are in general very...
-
Doubly Efficient Interactive Proofs over Infinite and Non-commutative Rings
We introduce the first proof system for layered arithmetic circuits over an arbitrary ring R that is (possibly) non-commutative and (possibly)...
-
Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security
We construct the first non-interactive zero-knowledge (NIZK) proof systems in the fine-grained setting where adversaries’ resources are bounded and...
-
Simple, Fast, Efficient, and Tightly-Secure Non-malleable Non-interactive Timed Commitments
Timed commitment schemes, introduced by Boneh and Naor (CRYPTO 2000), can be used to achieve fairness in secure computation protocols in a simple and...
-
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...
-
Strong Batching for Non-interactive Statistical Zero-Knowledge
A zero-knowledge proof enables a prover to convince a verifier that $$x \in...
-
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...
-
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...
-
Automated generation of illustrated proofs in geometry and beyond
Illustrations are only rarely formal components of mathematical proofs, however they are often very important for understanding proofs. Illustrations...
-
On Non-uniform Security for Black-Box Non-interactive CCA Commitments
We obtain a black-box construction of non-interactive CCA commitments against non-uniform adversaries. This makes black-box use of an appropriate...
-
Non-interactive Blind Signatures for Random Messages
Blind signatures allow a signer to issue signatures on messages chosen by the signature recipient. The main property is that the recipient’s message...
-
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
We consider the proximity testing problem for error-correcting codes which consist in evaluations of multivariate polynomials either of bounded...
-
Non-interactive Commitment from Non-transitive Group Actions
Group actions are becoming a viable option for post-quantum cryptography assumptions. Indeed, in recent years some works have shown how to construct...
-
Schematic Program Proofs with Abstract Execution
We propose Abstract Execution , a static verification framework based on symbolic execution and dynamic frames for proving properties of schematic ...
