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 QIDQ6604928FDOQ6604928
Authors: Dario Fiore, Dimitris Kolonelos, Paola de Perthuis
Publication date: 13 September 2024
Cites Work
- On lattices, learning with errors, random linear codes, and cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Identity-based cryptosystems and signature schemes
- Trapdoors for hard lattices and new cryptographic constructions
- 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
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Cuckoo hashing
- Explicit and efficient hash families suffice for cuckoo hashing with a stash
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Balanced allocation and dictionaries with tightly packed constant size bins
- Title not available (Why is that?)
- Oblivious RAM Revisited
- Space efficient hash tables with worst case constant access time
- More robust hashing: cuckoo hashing with a stash
- Identity-based encryption from the Diffie-Hellman assumption
- An Analysis of Random-Walk Cuckoo Hashing
- On the insertion time of cuckoo hashing
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Zero-Knowledge Sets with Short Proofs
- Laconic oblivious transfer and its applications
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Vector commitments and their applications
- Witness encryption and its applications
- Registration-based encryption: removing private-key generator from IBE
- Witness encryption from instance independent assumptions
- Hashing, load balancing and multiple choice
- On the insertion time of random walk cuckoo hashing
- Constant-Size Commitments to Polynomials and Their Applications
- Mr NISC: multiparty reusable non-interactive secure computation
- Verifiable registration-based encryption
- Registration-based encryption from standard assumptions
- Witness encryption and null-iO from evasive LWE
- Indistinguishability obfuscation from well-founded assumptions
- Optimizing registration based encryption
- Efficient laconic cryptography from learning with errors
- Balls into bins made faster
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- KVaC: key-value commitments for blockchains and beyond
- Functional commitments for all functions, with transparent setup and from SIS
- Registered attribute-based encryption
- Candidate witness encryption from lattice techniques
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Registered (inner-product) functional encryption
Cited In (5)
This page was built for publication: Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604928)