Sciweavers

20175 search results - page 22 / 4035
» Is abstraction the key to computing
Sort
View
93
Voted
CRYPTO
2009
Springer
87views Cryptology» more  CRYPTO 2009»
15 years 7 months ago
Reconstructing RSA Private Keys from Random Key Bits
sion of an extended abstract published in Proceedings of Crypto 2009, Springer-Verlag, 2009. Available from the IACR Cryptology ePrint Archive as Report 2008/510. We show that an ...
Nadia Heninger, Hovav Shacham
ICDCS
2002
IEEE
15 years 5 months ago
D-Stampede: Distributed Programming System for Ubiquitous Computing
We focus on an important problem in the space of ubiquitous computing, namely, programming support for the distributed heterogeneous computing elements that make up this environme...
Sameer Adhikari, Arnab Paul, Umakishore Ramachandr...
ATC
2007
Springer
15 years 6 months ago
Malicious Participants in Group Key Exchange: Key Control and Contributiveness in the Shadow of Trust
Group key exchange protocols allow their participants to compute a secret key which can be used to ensure security and privacy for various multi-party applications. The resulting g...
Emmanuel Bresson, Mark Manulis
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
14 years 13 days ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
EDBT
2009
ACM
102views Database» more  EDBT 2009»
15 years 7 months ago
On keys, foreign keys and nullable attributes in relational mapping systems
We consider the following scenario for a mapping system: given a source schema, a target schema, and a set of value correspondences between these two schemas, generate an executab...
Luca Cabibbo