Sciweavers

32 search results - page 6 / 7
» Verifying Compliance with Commitment Protocols
Sort
View
ENTCS
2006
142views more  ENTCS 2006»
13 years 5 months ago
Specialization of Interaction Protocols in a Temporal Action Logic
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
Laura Giordano, Alberto Martelli, Camilla Schwind
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 6 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 7 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
ADAEUROPE
2010
Springer
13 years 10 months ago
Practical Limits on Software Dependability: A Case Study
The technology for building dependable computing systems has advanced dramatically. Nevertheless, there is still no complete solution to building software for critical systems in w...
Patrick J. Graydon, John C. Knight, Xiang Yin
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
13 years 9 months ago
Symbolic model checking of institutions
Norms defined by institutions and enforced by organizations have been put forward as a mechanism to increase the efficiency and reliability of electronic transactions carried out ...
Francesco Viganò, Marco Colombetti