Sciweavers

TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 10 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
TCC
2007
Springer
146views Cryptology» more  TCC 2007»
15 years 10 months ago
Conjunctive, Subset, and Range Queries on Encrypted Data
We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x ∈ S). These systems support...
Dan Boneh, Brent Waters
TCC
2007
Springer
145views Cryptology» more  TCC 2007»
15 years 10 months ago
(Password) Authenticated Key Establishment: From 2-Party to Group
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
Michel Abdalla, Jens-Matthias Bohli, Maria Isabel ...
TCC
2007
Springer
142views Cryptology» more  TCC 2007»
15 years 10 months ago
On Best-Possible Obfuscation
An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-...
Shafi Goldwasser, Guy N. Rothblum
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 10 months ago
From Weak to Strong Watermarking
The informal goal of a watermarking scheme is to “mark” a digital object, such as a picture or video, in such a way that it is difficult for an adversary to remove the mark wit...
Nicholas Hopper, David Molnar, David Wagner
Cryptology
Top of PageReset Settings