Sciweavers

49 search results - page 6 / 10
» Model-Based Testing of Cryptographic Protocols
Sort
View
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
14 years 1 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
ASIACRYPT
1999
Springer
13 years 11 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
SFP
2003
13 years 8 months ago
Testing reactive systems with GAST
G∀ST is a fully automatic test system. Given a logical property, stated as a function, it is able to generate appropriate test values, to execute tests with these values, and to ...
Pieter W. M. Koopman, Rinus Plasmeijer
ISLPED
2003
ACM
197views Hardware» more  ISLPED 2003»
14 years 21 days ago
Analyzing the energy consumption of security protocols
Security is critical to a wide range of wireless data applications and services. While several security mechanisms and protocols have been developed in the context of the wired In...
Nachiketh R. Potlapally, Srivaths Ravi, Anand Ragh...
ECCC
2007
144views more  ECCC 2007»
13 years 7 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III