Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
From MaRDI portal
Publication:6604928
Recommendations
Cites work
- 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 method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- An Analysis of Random-Walk Cuckoo Hashing
- Balanced allocation and dictionaries with tightly packed constant size bins
- Balls into bins made faster
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate witness encryption from lattice techniques
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Cuckoo hashing
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Efficient laconic cryptography from learning with errors
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Functional commitments for all functions, with transparent setup and from SIS
- Hashing, load balancing and multiple choice
- Identity-based cryptosystems and signature schemes
- Identity-based encryption from the Diffie-Hellman assumption
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Indistinguishability obfuscation from well-founded assumptions
- KVaC: key-value commitments for blockchains and beyond
- Laconic oblivious transfer and its applications
- More robust hashing: cuckoo hashing with a stash
- Mr NISC: multiparty reusable non-interactive secure computation
- New directions in cryptography
- Oblivious RAM Revisited
- On lattices, learning with errors, random linear codes, and cryptography
- On the insertion time of cuckoo hashing
- On the insertion time of random walk cuckoo hashing
- Optimizing registration based encryption
- Registered (inner-product) functional encryption
- Registered attribute-based encryption
- Registration-based encryption from standard assumptions
- Registration-based encryption: removing private-key generator from IBE
- Space efficient hash tables with worst case constant access time
- Topics in Cryptology – CT-RSA 2005
- Trapdoors for hard lattices and new cryptographic constructions
- Universal Accumulators with Efficient Nonmembership Proofs
- Vector commitments and their applications
- Verifiable registration-based encryption
- Witness encryption and its applications
- Witness encryption and null-iO from evasive LWE
- Witness encryption from instance independent assumptions
- Zero-Knowledge Sets with Short Proofs
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
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)
