Sciweavers

5476 search results - page 238 / 1096
» Resettably Secure Computation
Sort
View
EUC
2006
Springer
15 years 10 months ago
Security in P2P Networks: Survey and Research Directions
A fundamental feature of Peer-to-Peer (P2P) networks is the honest collaboration among an heterogeneous community of participants. After Napster success
Esther Palomar, Juan M. Estévez-Tapiador, J...
ASIAN
2003
Springer
126views Algorithms» more  ASIAN 2003»
15 years 10 months ago
Information Flow Security for XML Transformations
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
Véronique Benzaken, Marwan Burelle, Giusepp...
EUROCRYPT
2011
Springer
14 years 10 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
IJNSEC
2008
115views more  IJNSEC 2008»
15 years 6 months ago
Improving Security Through Analysis of Log Files Intersections
The paper discusses our research in development of general and systematic methods for intrusion prevention. The key idea is to use data mining techniques to discover repeated patt...
Kazimierz Kowalski, Mohsen Beheshti
ICDCSW
2005
IEEE
16 years 8 days ago
Specifying Information-Flow Controls
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...
Howard Chivers, Jeremy Jacob