Sciweavers

183 search results - page 30 / 37
» The State of Cryptographic Hash Functions
Sort
View
CCS
1999
ACM
13 years 11 months ago
Signature Schemes Based on the Strong RSA Assumption
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
Ronald Cramer, Victor Shoup
ASIACRYPT
2011
Springer
12 years 7 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
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 22 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...
JOC
2000
181views more  JOC 2000»
13 years 7 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern