Search For:

Displaying 1-6 out of 6 total
Usable, Secure, Private Search
Found in: IEEE Security & Privacy
By Mariana Raykova,Ang Cui,Binh Vo,Bin Liu,Tal Malkin,Steven M. Bellovin,Salvatore J. Stolfo
Issue Date:September 2012
pp. 53-60
Real-world applications commonly require untrusting parties to share sensitive information securely. This article describes a secure anonymous database search (SADS) system that provides exact keyword match capability. Using a new reroutable encryption and...
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Found in: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)
By Sanjam Garg,Craig Gentry,Shai Halevi,Mariana Raykova,Amit Sahai,Brent Waters
Issue Date:October 2013
pp. 40-49
In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C 0 and C 1 of similar size, the obfuscations of C 0 and C 1 should be ...
The Zodiac Policy Subsystem: A Policy-Based Management System for a High-Security MANET
Found in: Policies for Distributed Systems and Networks, IEEE International Workshop on
By Yuu-Heng Cheng, Mariana Raykova, Alex Poylisher, Scott Alexander, Martin Eiger, Steve M. Bellovin
Issue Date:July 2009
pp. 174-177
Zodiac (Zero Outage Dynamic Intrinsically Assurable Communities) is an implementation of a high-security MANET, resistant to multiple types of attacks, including Byzantine faults. The Zodiac architecture poses a set of unique system security, performance, ...
Secure two-party computation in sublinear (amortized) time
Found in: Proceedings of the 2012 ACM conference on Computer and communications security (CCS '12)
By Fernando Krell, Jonathan Katz, Mariana Raykova, S. Dov Gordon, Tal Malkin, Vladimir Kolesnikov, Yevgeniy Vahlis
Issue Date:October 2012
pp. 513-524
Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit. If f depends on each of its input bits, this implies a protocol with complexity at least linear in the input size. In fact, linear runnin...
Private search in the real world
Found in: Proceedings of the 27th Annual Computer Security Applications Conference (ACSAC '11)
By Binh Vo, Mariana Raykova, Steven M. Bellovin, Tal Malkin, Vasilis Pappas
Issue Date:December 2011
pp. 83-92
Encrypted search --- performing queries on protected data --- has been explored in the past; however, its inherent inefficiency has raised questions of practicality. Here, we focus on improving the performance and extending its functionality enough to make...
Secure anonymous database search
Found in: Proceedings of the 2009 ACM workshop on Cloud computing security (CCSW '09)
By Binh Vo, Mariana Raykova, Steven M. Bellovin, Tal Malkin
Issue Date:November 2009
pp. 115-126
There exist many large collections of private data that must be protected on behalf of the entities that hold them or the clients they serve. However, there are also often many legitimate reasons for sharing that data in a controlled manner. How can two pa...