Sciweavers

351 search results - page 56 / 71
» Public-Key Cryptography and Availability
Sort
View
EUROCRYPT
2005
Springer
14 years 1 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 10 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
ARITH
1993
IEEE
13 years 11 months ago
Fast implementations of RSA cryptography
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
Mark Shand, Jean Vuillemin
IJNSEC
2010
163views more  IJNSEC 2010»
13 years 2 months ago
Evaluating the Effects of Symmetric Cryptography Algorithms on Power Consumption for Different Data Types
As the importance and the value of exchanged data over the Internet or other media types are increasing, the search for the best solution to offer the necessary protection against...
Diaa Salama Abdul Minaam, Hatem M. Abdual-Kader, M...
STORAGESS
2005
ACM
14 years 1 months ago
Secure capabilities for a petabyte-scale object-based distributed file system
Recently, the Network-Attached Secure Disk (NASD) model has become a more widely used technique for constructing large-scale storage systems. However, the security system proposed...
Christopher Olson, Ethan L. Miller