Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
The paper reports on an analysis technology based on the tracing approach to test trustworthy requirements of a distributed system. The system under test is instrumented such that...
Andreas Ulrich, Hesham Hallal, Alexandre Petrenko,...
Security is a crucial aspect in any modern software system. To ensure security in the final product, security requirements must be considered in the entire software development p...
We present a framework for certifying hardware designs generated through behavioral synthesis, by using formal verification to certify the associated synthesis transformations. We ...
Sandip Ray, Kecheng Hao, Yan Chen, Fei Xie, Jin Ya...