The following pages link to Information Security (Q5493180):
Displayed 12 items.
- A communication-efficient private matching scheme in client-server model (Q726566) (← links)
- Security and privacy aspects in MapReduce on clouds: a survey (Q739007) (← links)
- Selling multiple secrets to a single buyer (Q833739) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy (Q3092348) (← links)
- Two Generic Constructions of Probabilistic Cryptosystems and Their Applications (Q3540038) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- Another Look at Extended Private Information Retrieval Protocols (Q3637147) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)