157 search results - page 30 / 32 » Universally Composable Signcryption |
166
click to vote
PKC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
176
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
157
Voted
AGTIVE
1999
Springer
15 years 10 months ago
1999
Springer
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...
156
Voted
PODC
2010
ACM
15 years 9 months ago
2010
ACM
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
171
Voted
CRYPTO
2006
Springer
15 years 9 months ago
2006
Springer
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...