Roberto Tamassia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Roberto Tamassia has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Michael T. Goodrich
Department of Computer Science, University of California, Irvine, CA 92697
5 shared publications - Giuseppe Di Battista
Department of Engineering, Roma Tre University, Rome, Italy
4 shared publications - Giuseppe Liotta
Department of Engineering, University of Perugia, Perugia, Italy
4 shared publications - Giuseppe Di Battista
Terza Università di Roma
3 shared publications - Michael Mitzenmacher
Harvard University, Cambridge, MA, USA
2 shared publications - Nikos Triandopoulos
Boston University, 111 Cummington Mall, Boston, MA 02215, USA
2 shared publications
Latest Publications
- 9 January 2015
- Published by Springer Nature in Algorithmica
- Vol. 74 (2) , 664-712
Authenticated Hash Tables Based on Cryptographic Accumulators
- 9 January 2015
- Published by Springer Nature in Algorithmica
- Vol. 74 (2) , 664-712
Authenticated Hash Tables Based on Cryptographic Accumulators
- Open Access
Oblivious Storage with Low I/O Overhead
We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size $O(N^{1/c})$, for some constant $c\ge2$, in a single round, where $N$ is the size of the data set that Alice is storing with Bob. We also assume that Alice has a private memory of size $2N^{1/c}$. These assumptions model real-world cloud storage scenarios, where trade-offs occur between latency, bandwidth, and the size of the client's private memory.Open AccessOblivious Storage with Low I/O Overhead
We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size $O(N^{1/c})$, for some constant $c\ge2$, in a single round, where $N$ is the size of the data set that Alice is storing with Bob. We also assume that Alice has a private memory of size $2N^{1/c}$. These assumptions model real-world cloud storage scenarios, where trade-offs occur between latency, bandwidth, and the size of the client's private memory. - 30 August 2011
- Published by Springer Nature in The VLDB Journal
- Vol. 20 (5) , 767-791
Ranking continuous nearest neighbors for uncertain trajectories
- 30 August 2011
- Published by Springer Nature in The VLDB Journal
- Vol. 20 (5) , 767-791
Ranking continuous nearest neighbors for uncertain trajectories
- Open Access
Oblivious RAM Simulation with Efficient Worst-Case Access Overhead
Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments. It involves obscuring the access patterns to a remote storage so that the manager of that storage cannot infer information about its contents. Existing solutions typically involve small amortized overheads for achieving this goal, but nevertheless involve potentially huge variations in access times, depending on when they occur. In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.
Open AccessOblivious RAM Simulation with Efficient Worst-Case Access Overhead
Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments. It involves obscuring the access patterns to a remote storage so that the manager of that storage cannot infer information about its contents. Existing solutions typically involve small amortized overheads for achieving this goal, but nevertheless involve potentially huge variations in access times, depending on when they occur. In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.
- 11 September 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (3) , 505-552
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
- 11 September 2009
- Published by Springer Nature in Algorithmica
- Vol. 60 (3) , 505-552
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
- Open Access
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is being controlled by a remote untrusted host. We present efficient techniques for authenticating data structures that represent graphs and collections of geometric objects. We introduce the path hash accumulator, a new primitive based on cryptographic hashing for efficiently authenticating various properties of structured data represented as paths, including any decomposable query over sequences of elements. We show how to employ our primitive to authenticate queries about properties of paths in graphs and search queries on multi-catalogs. This allows the design of new, efficient authenticated data structures for fundamental problems on networks, such as path and connectivity queries over graphs, and complex queries on two-dimensional geometric objects, such as intersection and containment queries.
Open AccessEfficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is being controlled by a remote untrusted host. We present efficient techniques for authenticating data structures that represent graphs and collections of geometric objects. We introduce the path hash accumulator, a new primitive based on cryptographic hashing for efficiently authenticating various properties of structured data represented as paths, including any decomposable query over sequences of elements. We show how to employ our primitive to authenticate queries about properties of paths in graphs and search queries on multi-catalogs. This allows the design of new, efficient authenticated data structures for fundamental problems on networks, such as path and connectivity queries over graphs, and complex queries on two-dimensional geometric objects, such as intersection and containment queries.
- 28 November 2008
- Published by Elsevier in Theoretical Computer Science
- Vol. 408 (2-3) , 97-98
Preface
- 16 July 2008
- Published by SAGE Publications in Journal of Computer Security
- Vol. 16 (4) , 399-418
Notarized federated ID management and authentication*
This work was supported in part by the National Science Foundation under grants IIS-0324846, IIS-0713403 and OCI-0724806, and by IAM Technology, Inc. The work of the first author was done primarily as a consultant to Brown University. A preliminary v
- 16 July 2008
- Published by SAGE Publications in Journal of Computer Security
- Vol. 16 (4) , 399-418
Notarized federated ID management and authentication*
This work was supported in part by the National Science Foundation under grants IIS-0324846, IIS-0713403 and OCI-0724806, and by IAM Technology, Inc. The work of the first author was done primarily as a consultant to Brown University. A preliminary v
- Open Access
- 1 January 2004
- Published by Springer Nature
- p. 511-527
Efficient Tree-Based Revocation in Groups of Low-State Devices
- 1 January 2004
- Published by Springer Nature
- p. 511-527
Open AccessEfficient Tree-Based Revocation in Groups of Low-State Devices
- 1 August 2001
- Published by Elsevier in Information and Computation
- Vol. 169 (1) , 94-126
Incremental Convex Planarity Testing
- 1 August 2001
- Published by Elsevier in Information and Computation
- Vol. 169 (1) , 94-126
Incremental Convex Planarity Testing