Sciweavers

126 search results - page 23 / 26
» SMASH - A Cryptographic Hash Function
Sort
View
ECCC
2007
144views more  ECCC 2007»
13 years 7 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
CRYPTO
2006
Springer
124views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Mitigating Dictionary Attacks on Password-Protected Local Storage
We address the issue of encrypting data in local storage using a key that is derived from the user's password. The typical solution in use today is to derive the key from the...
Ran Canetti, Shai Halevi, Michael Steiner
COMPSAC
2004
IEEE
13 years 11 months ago
A Novel Key Management Scheme for Dynamic Access Control in a User Hierarchy
Considering the solution of dynamic access problems in a user hierarchy, a novel scheme based on one-way hash function is proposed to manage the cryptographic keys in the paper. T...
Tzer-Shyong Chen, Yu-Fang Chung, Chang-Sin Tian
CASES
2003
ACM
14 years 26 days ago
Encryption overhead in embedded systems and sensor network nodes: modeling and analysis
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
Ramnath Venugopalan, Prasanth Ganesan, Pushkin Ped...
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin