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...
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
nvented abstract representations of value. As time passed, representations of value became more abstract, progressing from barter through bank notes, payment orders, checks, credit...
N. Asokan, Philippe A. Janson, Michael Steiner, Mi...
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
In this paper we study security definitions for authenticated key exchange (AKE) protocols. We observe that there are several families of attacks on AKE protocols that lie outsid...
Brian A. LaMacchia, Kristin Lauter, Anton Mityagin