scientific article
From MaRDI portal
Publication:3374903
zbMath1082.68567MaRDI QIDQ3374903
Rafail Ostrovsky, Eyal Kushilevitz
Publication date: 1 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)
Related Items
Selling multiple secrets to a single buyer, Lower bounds for (batch) PIR with private preprocessing, Privacy-enhanced attribute-based private information retrieval, Random-index PIR and applications, An Efficient PIR Construction Using Trusted Hardware, On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols, A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval, Simple and generic constructions of succinct functional encryption, On the Security Loss in Cryptographic Reductions, Minicrypt primitives with algebraic structure and applications, Verifiable single-server private information retrieval from LWE with binary errors, Private information retrieval with sublinear online time, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
