154 search results - page 19 / 31 » Cryptographically Sound Theorem Proving |
COORDINATION
2007
Springer
14 years 1 months ago
2007
Springer
We suggest a Calculus for Mobile Ad Hoc Networks, CMAN. A node in a network is a processes equipped with a location, it may communicate with other nodes using synchronous local bro...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...