Theory of Cryptography

DOI10.1007/b106171zbMath1079.94554OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711657

Eyal Kushilevitz, Yuval Ishai, Rafail Ostrovsky

Publication date: 7 December 2005

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

Full work available at URL: https://doi.org/10.1007/b106171

zbMATH Keywords

homomorphic encryptionCollision-resistant hash functionsprivate information-retrieval

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Secure multiparty computation with sublinear preprocessing ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Cryptographic group actions and applications ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ On Basing Private Information Retrieval on NP-Hardness ⋮ Information hiding using matroid theory ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Fine-Grained Cryptography

This page was built for publication: Theory of Cryptography