Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers

DOI10.1007/978-3-031-14791-3_33MaRDI QIDQ6134857zbMATHOpenAlexFDO

Authors Matteo Campanelli, Felix Engelmann, Claudio Orlandi

Publication date 25 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://eprint.iacr.org/2021/1678

zbMATH Keywords

zero-knowledgecommitmentskey-value map

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• KVaC: key-value commitments for blockchains and beyond
• Efficient zero-knowledge arguments from two-tiered homomorphic commitments
• Efficient UC commitment extension with homomorphism for free (and applications)
• Updatable Zero-Knowledge Databases
• Secure database commitments and universal arguments of quasi knowledge

Cites work

• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient batch zero-knowledge arguments for low degree polynomials
• Efficient indifferentiable hashing into ordinary elliptic curves
• Encrypted key-value stores
• Feistel structures for MPC, and more
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
• Improved elliptic curve hashing and point representation
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
• Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
• KVaC: key-value commitments for blockchains and beyond
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Quisquis: a new design for anonymous cryptocurrencies
• Vector commitments and their applications
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
• Zero-knowledge proofs for set membership: efficient, succinct, modular

Cited in

(7)

• Publicly verifiable zero knowledge from (collapsing) blockchains
• Functional commitments for all functions, with transparent setup and from SIS
• Lattice-based key-value commitment scheme with key-binding and key-hiding properties
• Pribank: confidential blockchain scaling using short commit-and-proof NIZK argument
• Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
• KVaC: key-value commitments for blockchains and beyond

This page was built for publication: Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers

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