JustMyFriends
Published 20 May 2012
Arthur Meacham, Dennis Shasha
Citations3
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
JustMyFriends ensures sharing among friends without revealing unencrypted data to anyone outside of a circle of trust, and provides full access privacy in the user's data access behavior.
Abstract
A major obstacle to using Cloud services for many enterprises is the fear that the data will be stolen. Bringing the Cloud in-house is an incomplete solution to the problem because that implies that data center personnel as well as myriad repair personnel must be trusted. An ideal security solution would be to share data among precisely the people who should see it ("my friends") and nobody else.
Keywords
Computer Science
Fully homomorphic encryption using ideal lattices
6,381 Citations2009Craig Gentry
This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Hey, you, get off of my cloud
2,015 Citations2009Thomas Ristenpart, Eran Tromer +2 more
Executing SQL over encrypted data in the database-service-provider model
1,143 Citations2002Hakan Hacígümüş, B. R. Iyer +2 more
The paper explores an algebraic framework to split the query to minimize the computation at the client site, and explores techniques to execute SQL queries over encrypted data.
Private information retrieval
1,116 Citations2002Benny Chor, Oded Goldreich +2 more
Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described.
Can homomorphic encryption be practical?
971 Citations2011Michael Naehrig, Kristin Lauter +1 more
A proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem, and a number of application-specific optimizations to the encryption scheme, including the ability to convert between different message encodings in a ciphertext.
Replication is not needed: single database, computationally-private information retrieval
919 Citations2002Eyal Kushilevitz, Rafail Ostrovsky
Based on the quadratic residuosity assumption, a single database, computationally private information retrieval scheme with O(n/sup /spl epsiv//) communication complexity for any /spl Epsiv/>0.0 is presented.
Oblivious transfer and polynomial evaluation
630 Citations1999Moni Naor, Benny Pinkas
The efficiency of the new OT protocols makes them useful for a variety of applications, including oblivious sampling which can be used to securely compare the sizes of web search engines, protocols for privately solving the list intersection problem and for mutually authenticated key exchange based on (possibly weak) passwords, and protocols for anonymity preserving web usage metering.
Symposium on Discrete AlgorithmsEfficient oblivious transfer protocols
627 Citations2001Moni Naor, Benny Pinkas
This paper presents several significant improvements to oblivious transfer protocols of strings, and in particular providing the first two-round OT protocol whose security analysis does not invoke the random oraclemodel.
Secure Untrusted Data Repository (SUNDR)
404 Citations2003Jinyuan Li, Maxwell Krohn +2 more
SUNDR's protocol achieves a property called fork consistency, which guarantees that clients can detect any integrity or consistency failures as long as they see each other's file modifications.
Elsevier eBooksA Privacy-Preserving Index for Range Queries
398 Citations2004Bijit Hore, Sharad Mehrotra +1 more
This paper analyzes the data partitioning (bucketization) technique and algorithmically develops this technique to build privacy-preserving indices on sensitive attributes of a relational table and develops a novel algorithm for achieving the desired balance between privacy and utility of the index.
PubMedChildhood obesity and insulin-resistant syndrome.
225 Citations2004Ariel J. Feldman, William P. Zeller +1 more
SPORC is a generic framework for building a wide variety of collaborative applications with untrusted servers that illustrates the complementary benefits of operational transformation (OT) and fork* consistency and can automatically recover from malicious forks.
All your clouds are belong to us
141 Citations2011Juraj Somorovsky, Mario Heiderich +4 more
This research results are alarming: in regards to the Amazon EC2 and S3 services, the control interfaces could be compromised via the novel signature wrapping and advanced XSS techniques and the Eucalyptus control interfaces were vulnerable to classical signature wrapping attacks, and had nearly no protection against XSS.
Lecture notes in computer scienceOne-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
105 Citations2000Eyal Kushilevitz, Rafail Ostrovsky
This work presents a protocol in which the user sends O(K2) bits and the server sends n - cn/K bits (for any constant c), where K is the security parameter of the trapdoor permutations.
Network and Distributed System Security SymposiumThe Blind Stone Tablet: Outsourcing Durability to Untrusted Parties
43 Citations2009Peter Williams, Radu Sion +1 more
A new paradigm for outsourcing the durability property of a multi-client transactional database to an untrusted service provider is introduced, creating a novel class of secure database outsourcing models with full transaction privacy and guaranteed correctness.