743 search results - page 63 / 149 » Secure Signature Schemes based on Interactive Protocols |
CSFW
2008
IEEE
14 years 3 months ago
2008
IEEE
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
ICICS
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
CRYPTO
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
EUROCRYPT
2010
Springer
14 years 1 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
EUROCRYPT
2000
Springer
14 years 13 days ago
2000
Springer
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...