Sciweavers

686 search results - page 100 / 138
» Secure Two-Party Computation Is Practical
Sort
View
PST
2008
13 years 11 months ago
Encoding the Program Correctness Proofs as Programs in PCC Technology
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating and storing the proofs which are inh...
Heidar Pirzadeh, Danny Dubé
RAID
2010
Springer
13 years 8 months ago
Inferring Protocol State Machine from Real-World Trace
Application-level protocol specifications are helpful for network security management, including intrusion detection, intrusion prevention and detecting malicious code. However, c...
Yipeng Wang, Zhibin Zhang, Li Guo
TCC
2010
Springer
324views Cryptology» more  TCC 2010»
14 years 7 months ago
Leakage-Resilient Signatures
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to ...
Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, G...
CCS
2010
ACM
14 years 4 months ago
Effective trust management through a hybrid logical and relational approach
Despite a plethora of recent research regarding trust management approaches to authorization, relatively little attention has been given to exactly how these technologies can be e...
Adam J. Lee, Ting Yu, Yann Le Gall
ICNP
2007
IEEE
14 years 4 months ago
Routing amid Colluding Attackers
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
Jakob Eriksson, Michalis Faloutsos, Srikanth V. Kr...