Reference : UC Updatable Non-Hiding Committed Database with Efficient Zero-Knowledge Proofs
 Document type : E-prints/Working papers : First made available on ORBilu Discipline(s) : Engineering, computing & technology : Computer science Focus Areas : Computational Sciences To cite this reference: http://hdl.handle.net/10993/39421
 Title : UC Updatable Non-Hiding Committed Database with Efficient Zero-Knowledge Proofs Language : English Author, co-author : Rial Duran, Alfredo [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >] Publication date : 2019 Number of pages : 25 Peer reviewed : No Keywords : [en] vector commitments ; universal composability ; modular design Abstract : [en] We define an ideal functionality $\Functionality_{\DB}$ and a protocol $\mathrm{\Pi_{\DB}}$ for an updatable non-hiding committed database ($\DB$). $\DB$ is described as the task of storing a database into a suitable data structure that allows you to efficiently prove in zero-knowledge (ZK) that a value is stored in the database at a certain position. The database is \emph{non-hiding} because both prover and verifier know its content. It is \emph{committed} in the sense that only ZK proofs about position-value pairs that are actually stored are possible. It is \emph{updatable} because its contents can be modified dynamically throughout the protocol execution. The $\DB$ task is used implicitly as building block of privacy-preserving protocols for e-commerce, smart billing and access control. In those protocols, this task is intertwined with others. Our functionality $\Functionality_{\DB}$ allows us to study constructions for this task in isolation. Furthermore, it allows us to improve modularity in protocol design, by using $\Functionality_{\DB}$ as building block of those protocols along with functionalities for other tasks. Our construction $\mathrm{\Pi_{\DB}}$ uses a non-hiding vector commitment (VC) scheme as building block. Thanks to the efficiency properties of non-hiding VC schemes, $\mathrm{\Pi_{\DB}}$ provides ZK proofs whose computation cost (after initialization) and whose size are both independent of the database size. Therefore, $\mathrm{\Pi_{\DB}}$ is suitable for large databases. Moreover, the database can be updated dynamically and very efficiently. Target : Researchers Permalink : http://hdl.handle.net/10993/39421 FnR project : FnR ; FNR11650748 > Alfredo Rial > SZK > Stateful Zero-Knowledge > 01/03/2018 > 28/02/2021 > 2017

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
main.pdfAuthor preprint458.89 kBView/Open

All documents in ORBilu are protected by a user license.