1777 search results - page 17 / 356 » Programming Cryptographic Protocols |
BIRTHDAY
2006
Springer
14 years 10 days ago
2006
Springer
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
IEEEARES
2008
IEEE
14 years 3 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
PKC
2005
Springer
14 years 2 months ago
2005
Springer
The Miller-Rabin pseudo primality test is widely used in cryptographic libraries, because of its apparent simplicity. But the test is not always correctly implemented. For example ...
MMMACNS
2001
Springer
14 years 1 months ago
2001
Springer
The history of the application of formal methods to cryptographic protocol analysis spans nearly twenty years, and recently has been showing signs of new maturity and consolidatio...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Proxies provide important rendezvous service in the Session Initiation Protocol (SIP), but it comes at a cost to privacy. A SIP proxy is privy to all of the signaling exchanged ...