Sciweavers

948 search results - page 123 / 190
» Attacking cryptographic schemes based on
Sort
View
ACSC
2004
IEEE
13 years 11 months ago
Establishing Trust In Pure Ad-hoc Networks
An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. It is also often termed an infrastructure-less, self-or...
Asad Amir Pirzada, Chris McDonald
CCR
2007
115views more  CCR 2007»
13 years 8 months ago
Analysis of the SPV secure routing protocol: weaknesses and lessons
We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (...
Barath Raghavan, Saurabh Panjwani, Anton Mityagin
ISW
2009
Springer
14 years 2 months ago
Towards Security Notions for White-Box Cryptography
Abstract. While code obfuscation attempts to hide certain characteristics of a program independently of an application, white-box cryptography (WBC) specifically focuses on softwa...
Amitabh Saxena, Brecht Wyseur, Bart Preneel
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
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval