Sciweavers

405 search results - page 48 / 81
» Practice-Oriented Provable Security
Sort
View
ASIACRYPT
2000
Springer
13 years 12 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...
ASIACRYPT
2006
Springer
13 years 11 months ago
On the Security of OAEP
Currently, the best and only evidence of the security of the OAEP encryption scheme is a proof in the contentious random oracle model. Here we give further arguments in support of...
Alexandra Boldyreva, Marc Fischlin
CCS
2010
ACM
13 years 7 months ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper
KBSE
2005
IEEE
14 years 1 months ago
A threat-driven approach to modeling and verifying secure software
This paper presents a formal approach to threat-driven modeling and verification of secure software using aspect-oriented Petri nets. Based on the behavior model of intended funct...
Dianxiang Xu, Kendall E. Nygard
ACNS
2004
Springer
106views Cryptology» more  ACNS 2004»
14 years 1 months ago
On the Security of Cryptosystems with All-or-Nothing Transform
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai