Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
From MaRDI portal
Publication:6604928
DOI10.1007/978-981-99-8733-7_6zbMATH Open1547.94365MaRDI QIDQ6604928
Dimitris Kolonelos, Dario Fiore, Paola de Perthuis
Publication date: 13 September 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit and efficient hash families suffice for cuckoo hashing with a stash
- Registration-based encryption: removing private-key generator from IBE
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- Space efficient hash tables with worst case constant access time
- Verifiable registration-based encryption
- Mr NISC: multiparty reusable non-interactive secure computation
- Optimizing registration based encryption
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Registration-based encryption from standard assumptions
- Balanced allocation and dictionaries with tightly packed constant size bins
- KVaC: key-value commitments for blockchains and beyond
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Balls into Bins Made Faster
- Witness Encryption from Instance Independent Assumptions
- Identity-Based Cryptosystems and Signature Schemes
- Constant-Size Commitments to Polynomials and Their Applications
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Trapdoors for hard lattices and new cryptographic constructions
- Oblivious RAM Revisited
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- On the insertion time of random walk cuckoo hashing
- Cuckoo hashing
- Vector Commitments and Their Applications
- Hashing, Load Balancing and Multiple Choice
- On the Insertion Time of Cuckoo Hashing
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Zero-Knowledge Sets with Short Proofs
- Witness encryption and its applications
- Topics in Cryptology – CT-RSA 2005
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
- More Robust Hashing: Cuckoo Hashing with a Stash
- An Analysis of Random-Walk Cuckoo Hashing
- Functional commitments for all functions, with transparent setup and from SIS
- Efficient laconic cryptography from learning with errors
- Registered attribute-based encryption
- Indistinguishability obfuscation from well-founded assumptions
- Witness encryption and null-iO from evasive LWE
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Candidate witness encryption from lattice techniques
- Registered (inner-product) functional encryption
Related Items (5)
Oblivious accumulators ⋮ Reducing the CRS size in registered ABE systems ⋮ A modular approach to registered ABE for unbounded predicates ⋮ Threshold encryption with silent setup ⋮ Universal vector commitments
This page was built for publication: Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
