5 search results - page 1 / 1 » Strong Invariants for the Efficient Construction of Machine-... |
CSFW
2010
IEEE
13 years 7 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
ACNS
2007
Springer
13 years 8 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
ACISP
2006
Springer
13 years 8 months ago
2006
Springer
Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered a...