12 search results - page 2 / 3 » Composability of Secrecy |
CRYPTO
2006
Springer
13 years 10 months ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
PODC
2004
ACM
13 years 11 months ago
2004
ACM
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
CCS
2007
ACM
14 years 14 days ago
2007
ACM
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
CIDR
2009
13 years 7 months ago
2009
In recent years, there has been a proliferation of declarative logic-based trust management languages and systems proposed to ease the description, configuration, and enforcement ...
SCN
2011
Springer
13 years 1 months ago
2011
Springer
Model checking cryptographic protocols have evolved to a valuable method for discovering counterintuitive security flaws, which make possible for a hostile agent to subvert the go...