Sciweavers

1777 search results - page 77 / 356
» Programming Cryptographic Protocols
Sort
View
INFOCOM
1997
IEEE
14 years 29 days ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
CAV
2007
Springer
111views Hardware» more  CAV 2007»
14 years 23 days ago
Verification Across Intellectual Property Boundaries
In many industries, the share of software components provided by third-party suppliers is steadily increasing. As the suppliers seek to secure their intellectual property (IP) righ...
Sagar Chaki, Christian Schallhart, Helmut Veith
ECCC
2007
144views more  ECCC 2007»
13 years 8 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
ICSE
2007
IEEE-ACM
14 years 8 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
CCS
2009
ACM
14 years 3 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal