In this paper, we study the opacity property of verifiably encrypted signatures (VES) of Boneh et al. (proposed in Eurocrypt 2003). Informally, opacity implies that although some given aggregate signatures can verified, no useful information about the individual signatures is leaked. However, the very fact that an aggregate signature can be verified leaks certain information - that the individual signature is indeed well-formed. Apart from this, is there any other information leaked? In this paper, we show that there is absolutely no other information leaked about the individual signatures when the aggregation contains only two signatures. In more formal terms, we show that VES are Zero-Knowledge (ZK). We then extend the ZK property of VES ...
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge...
The material below covers two lectures on the beautiful and influential concept of zero-knowledge pr...
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets ab...
1 Introduction In this work, we propose a new construction of Non-Interactive Witness Indistinguisha...
Motivated by the goal of removing trusted setup assumptions from cryptography, we introduce the noti...
Abstract. Zero-knowledge proofs with witness elimination are proto-cols that enable a prover to demo...
Zero-Knowledge Protocols and Witness Encryption are usually defined for NP relations. I show that th...
Zero-Knowledge Protocols and Witness Encryption are usually defined for NP relations. I show that th...
AbstractFormulations and properties of proving possession of knowledge in interactive protocols are ...
A zero-knowledge proof is a fundamental cryptographic primitive that enables the verification of sta...
International audienceWhile non-interactive zero-knowledge (NIZK) proofs require trusted parameters,...
We explore a new man-in-the-middle adversarial model for multi-prover interactive proofs (MIPs), and...
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets ab...
Crypto-computing is a set of well-known techniques for computing with encrypted data. The security o...
Verifiable encryption allows to encrypt a signature and prove that the plaintext is valid. We intro...
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge...
The material below covers two lectures on the beautiful and influential concept of zero-knowledge pr...
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets ab...
1 Introduction In this work, we propose a new construction of Non-Interactive Witness Indistinguisha...
Motivated by the goal of removing trusted setup assumptions from cryptography, we introduce the noti...
Abstract. Zero-knowledge proofs with witness elimination are proto-cols that enable a prover to demo...
Zero-Knowledge Protocols and Witness Encryption are usually defined for NP relations. I show that th...
Zero-Knowledge Protocols and Witness Encryption are usually defined for NP relations. I show that th...
AbstractFormulations and properties of proving possession of knowledge in interactive protocols are ...
A zero-knowledge proof is a fundamental cryptographic primitive that enables the verification of sta...
International audienceWhile non-interactive zero-knowledge (NIZK) proofs require trusted parameters,...
We explore a new man-in-the-middle adversarial model for multi-prover interactive proofs (MIPs), and...
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets ab...
Crypto-computing is a set of well-known techniques for computing with encrypted data. The security o...
Verifiable encryption allows to encrypt a signature and prove that the plaintext is valid. We intro...
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge...
The material below covers two lectures on the beautiful and influential concept of zero-knowledge pr...
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets ab...