Sciweavers

619 search results - page 33 / 124
» Learning with Security
Sort
View
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
ICC
2007
IEEE
111views Communications» more  ICC 2007»
14 years 2 months ago
Security in All-Optical Networks: Self-Organization and Attack Avoidance
—While transparent WDM optical networks become more and more popular as the basis of the Next Generation Internet (NGI) infrastructure, such networks raise many unique security i...
Jae-Seung Yeom, Ozan K. Tonguz, Gerardo A. Casta&n...
DCC
2008
IEEE
14 years 7 months ago
Semantic security for the McEliece cryptosystem without random oracles
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
Ryo Nojima, Hideki Imai, Kazukuni Kobara, Kirill M...
CIA
2006
Springer
13 years 11 months ago
Using Electronic Institutions to Secure Grid Environments
As the technical infrastructure to support Grid environments matures, attention must be focused on integrating such technical infrastructure with technologies to support more dynam...
Ronald Ashri, Terry R. Payne, Michael Luck, Mike S...
EUROCRYPT
2000
Springer
13 years 11 months ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver