activity
20102020
most citedMixing Time and Stationary Expected Social Welfare of Logit Dynamics

11 citations · 15 across the 9 of their papers we have counts for

collaborators
Showing cs.CRShow all

5 papers · 1 filter

cs.CR2019

What Storage Access Privacy is Achievable with Small Overhead?

Sarvar Patel, Giuseppe Persiano, Kevin Yeo

Oblivious RAM (ORAM) and private information retrieval (PIR) are classic cryptographic primitives used to hide the access pattern to data whose storage has been outsourced to an un…

cs.CR2019

Secure selections on encrypted multi-writer streams

Angelo Massimo Perillo, Giuseppe Persiano, Alberto Trombetta

Performing searches over encrypted data is a very current and active area. Several efficient solutions have been provided for the single-writer scenario in which all sensitive data…

cs.CR2017

CacheShuffle: An Oblivious Shuffle Algorithm Using Caches

Sarvar Patel, Giuseppe Persiano, Kevin Yeo

We consider Oblivious Shuffling and K-Oblivious Shuffling, a refinement thereof. We provide efficient algorithms for both and discuss their application to the design of Oblivious R…

cs.CR2014

Answering queries using pairings

Alberto Trombetta, Giuseppe Persiano, Stefano Braghin

Outsourcing data in the cloud has become nowadays very common. Since -- generally speaking -- cloud data storage and management providers cannot be fully trusted, mechanisms provid…

cs.CR2013★ 1 cited

Secure and Policy-Private Resource Sharing in an Online Social Network

Stefano Braghin, Vincenzo Iovino, Giuseppe Persiano +1

Providing functionalities that allow online social network users to manage in a secure and private way the publication of their information and/or resources is a relevant and far f…