Efficient Non-Interactive Zero Knowledge Arguments for Set Operations

Fauzi, Prastudy; Lipmaa, Helger; Zhang, Bingsheng

doi:10.1007/978-3-662-45472-5_14

Cited by 5 publications

(3 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The core idea is to enable the verification of comparison results on private values. However, these previous works consider relational/spatial data only, not set-valued data, reference set operations multiset operations aggregate queries privacy preserving [25], [26], [27] [29] only sum [30], [31] our work which are the focus of this paper. As we will see later in this paper, aggregate queries over set-valued data heavily involve primitive multiset operations such as set union and subset.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Authenticating Aggregate Queries over Set-Valued Data with Confidentiality

Chen

et al. 2018

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

With recent advances in data-as-a-service (DaaS) and cloud computing, aggregate query services over set-valued data are becoming widely available for business intelligence that drives decision making. However, as the service provider is often a third-party delegate of the data owner, the integrity of the query results cannot be guaranteed and is thus imperative to be authenticated. Unfortunately, existing query authentication techniques either do not work for set-valued data or they lack data confidentiality. In this paper, we propose authenticated aggregate queries over set-valued data that not only ensure the integrity of query results but also preserve the confidentiality of source data. As many aggregate queries are composed of multiset operations such as set union and subset, we first develop a family of privacy-preserving authentication protocols for primitive multiset operations. Using these protocols as building blocks, we present a privacy-preserving authentication framework for various aggregate queries and further optimize their authentication performance. Security analysis and empirical evaluation show that our proposed privacy-preserving authentication techniques are feasible and robust under a wide range of system workloads.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Protecting the confidentiality of source data requires designing new cryptographic constructs on primitive multiset operations. The preliminary work in [29] supports multiset sum operations only. Papadopoulos et al proposed a zero-knowledge accumulator for set-valued data and common primitive operations [30].…”

Section: Related Workmentioning

confidence: 99%

Authenticating Aggregate Queries over Set-Valued Data with Confidentiality

Chen

et al. 2018

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…Like this work, the argument relies only on the discrete logarithm assumption, but the communication complexity is much higher; linear in the size of the set. Camenisch et al [12] also provide set membership proofs with logarithmic communication complexity, and Fauzi et al [22] construct constant size arguments for more complex relations between committed sets. The latter two works both rely on pairing-based assumptions.…”

Section: Referencementioning

confidence: 99%

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

Bootle

Groth

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Bootle et al. (EUROCRYPT 2016) construct an extremely efficient zero-knowledge argument for arithmetic circuit satisfiability in the discrete logarithm setting. However, the argument does not treat relations involving commitments, and furthermore, for simple polynomial relations, the complex machinery employed is unnecessary. In this work, we give a framework for expressing simple relations between commitments and field elements, and present a zero-knowledge argument which, by contrast with Bootle et al., is constant-round and uses fewer group operations, in the case where the polynomials in the relation have low degree. Our method also directly yields a batch protocol, which allows many copies of the same relation to be proved and verified in a single argument more efficiently with only a square-root communication overhead in the number of copies. We instantiate our protocol with concrete polynomial relations to construct zero-knowledge arguments for membership proofs, polynomial evaluation proofs, and range proofs. Our work can be seen as a unified explanation of the underlying ideas of these protocols. In the instantiations of membership proofs and polynomial evaluation proofs, we also achieve better efficiency than the state of the art.

show abstract