Sciweavers

2043 search results - page 200 / 409
» Reasoning About Security Models
Sort
View
CSFW
2011
IEEE
14 years 6 months ago
The Complexity of Quantitative Information Flow Problems
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
IUI
2000
ACM
15 years 10 months ago
Extending software through metaphors and metonymies
This article is about applications that can be customized or extended through their own user interface. This is achieved by the interface’s ability to interpret users’ non-lit...
Simone Diniz Junqueira Barbosa, Clarisse Sieckeniu...
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
16 years 9 days ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
TARK
2007
Springer
16 years 9 days ago
Knowledge-based modelling of voting protocols
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
A. Baskar, Ramaswamy Ramanujam, S. P. Suresh
AAAI
1994
15 years 7 months ago
An Instructional Environment for Practicing Argumentation Skills
CAT0 is an instructions environment for practicing basic skills of legal research: to use cases in arguments about a problem situation and to test a theory about a legal domain. U...
Vincent Aleven, Kevin D. Ashley