Unique signatures, verifiable random functions, application of groups with DH-DDH separation. 1 Introduction. Signature schemes are one of the most important ...

A unique signature scheme has the property that a signa- ture σª«(m) is a (hard-to-compute) function of the public key PK and message m, for all, even ...

Jan 1, 2002 · Unique signatures, introduced by Goldwasser and Ostrovsky, have been shown to be a building block for constructing verifiable random functions.

Here, we give a construction of a unique signature scheme based on a generalization of the Diffe-Hellman assumption in groups where decisional Diffe-Hellman is ...

Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. Authors: Anna Lysyanskaya. Download: DOI: 10.1007/3-540-45708-9_38 (login may be ...

Unique signatures and verifiable random functions from the DH-DDH separation. A Lysyanskaya. Advances in Cryptology—CRYPTO 2002: 22nd Annual International ...

Lysyanskaya, A.: Unique signatures and verifiable random functions from the dh- ddh separation. In: CRYPTO. (2002) 597–612. 15. Dodis, Y.: Efficient ...

Lysyanskaya, A.: Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 597–612 ...

The main application of unique signatures, e.g. in [24,12], has been the construction of Verifiable Random Functions (VRF) [25] — these are pseu- dorandom ...

This work gives a simple and efficient construction of a verifiable random function (VRF) on bilinear groups and shows that the scheme can be instantiated ...