Sciweavers

343 search results - page 42 / 69
» Formal security analysis of PKCS
Sort
View
IFIP
2010
Springer
14 years 6 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
15 years 5 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
LPAR
2007
Springer
15 years 6 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
FC
2005
Springer
83views Cryptology» more  FC 2005»
15 years 5 months ago
Secure Distributed Human Computation
We suggest a general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are e...
Craig Gentry, Zulfikar Ramzan, Stuart G. Stubblebi...
AGENTS
2000
Springer
15 years 4 months ago
Frameworks for Reasoning about Agent Based Systems
This paper suggests formal frameworks that can be used as the basis for defining, reasoning about, and verifying properties of agent systems. The language, Little-JIL is graphical...
Leon J. Osterweil, Lori A. Clarke