Paper 2017/111 Original: eprint.iacr.org/2017/111 ↗
EC-OPRF: Oblivious Pseudorandom Functions using Elliptic Curves
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2017-02-14: last updated
- 2017-02-14: published
- Short URL
- https://ia.cr/2017/111
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/111,
author = {Jonathan Burns and Daniel Moore and Katrina Ray and Ryan Speers and Brian Vohaska},
title = {EC-OPRF: Oblivious Pseudorandom Functions using Elliptic Curves},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/111},
year = {2017},
url = {https://eprint.iacr.org/2017/111}
}