Cryptology ePrint Archive: Report 2017/111

EC-OPRF: Oblivious Pseudorandom Functions using Elliptic Curves

Jonathan Burns and Daniel Moore and Katrina Ray and Ryan Speers and Brian Vohaska

Abstract: We introduce a secure elliptic curve oblivious pseudorandom function (EC-OPRF) which operates by hashing strings onto an elliptic curve to provide a simple and efficient mechanism for computing an oblivious pseudorandom function (OPRF). The EC-OPRF protocol enables a semi-trusted server to receive a set of cryptographically masked elliptic curve points from a client, secure those points with a private key, and return the resulting set to the client for unmasking. We also introduce extensions and generalizations to this scheme, including a novel mechanism that provides forward secrecy, and discuss the security and computation complexity for each variant. Benchmark tests for the implementations of the EC-OPRF protocol and one of its variants are provided, along with test vectors for the original protocol.

Category / Keywords: cryptographic protocols / oblivious psuedorandom function, elliptic curve cryptosystem, multi-party computation, public-key cryptography, hash functions

Date: received 10 Feb 2017

Contact author: ryan at ionicsecurity com

Available format(s): PDF | BibTeX Citation

Version: 20170214:183249 (All versions of this report)

Short URL: ia.cr/2017/111

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]