UC Updatable Databases and Applications

DOI10.1007/978-3-030-51938-4_4OpenAlexMaRDI QIDQ5048962FDO

Authors Aditya Damodaran, Alfredo Rial

Publication date 9 November 2022

Published in Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-51938-4_4

zbMATH Keywords

universal composabilityvector commitmentsZK proofs

Mathematics Subject Classification ID

Theory of data (68Pxx)

Cites work

• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1942413 (Why is no real title available?)
• scientific article; zbMATH DE number 1394309 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A framework for practical universally composable zero-knowledge protocols
• Adaptive oblivious transfer with access control from lattice assumptions
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Constant-Size Commitments to Polynomials and Their Applications
• Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
• Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
• Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
• Group signatures with almost-for-free revocation
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Quadratic span programs and succinct NIZKs without PCPs
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• Sublinear zero-knowledge arguments for RAM programs
• Subvector commitments with application to succinct arguments
• Topics in Cryptology – CT-RSA 2005
• UC commitments for modular protocol design and applications to revocation and attribute tokens
• Universally Composable Adaptive Priced Oblivious Transfer
• Updatable Zero-Knowledge Databases
• Vector commitments and their applications
• Zero-Knowledge Accumulators and Set Algebra
• Zero-Knowledge Authenticated Order Queries and Order Statistics on a List

Describes a project that uses

Uses Software

• Charm

This page was built for publication: UC Updatable Databases and Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048962)