52 search results - page 2 / 11 » Validation of Cryptographic Protocols by Efficient Automated... |
CCS
2010
ACM
14 years 9 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
164
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
Software defects, commonly known as bugs, present a serious challenge for system reliability and dependability. Once a program failure is observed, the debugging activities to loc...
CSFW
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
TVLSI
2008
14 years 9 months ago
2008
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...