Information Security
From MaRDI portal
Publication:5493180
DOI10.1007/11556992zbMath1159.68444MaRDI QIDQ5493180
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11556992
oblivious transfer; Computationally-private information retrieval; length-flexible additively homomorphic public-key cryptosystem
68P25: Data encryption (aspects in computer science)
Related Items
Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval, A communication-efficient private matching scheme in client-server model, Security and privacy aspects in MapReduce on clouds: a survey, Selling multiple secrets to a single buyer, Private multiparty sampling and approximation of vector combinations, On Basing Private Information Retrieval on NP-Hardness, Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM, Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy, Two Generic Constructions of Probabilistic Cryptosystems and Their Applications, New Communication-Efficient Oblivious Transfer Protocols Based on Pairings, Another Look at Extended Private Information Retrieval Protocols