EC-OPRF: Oblivious Pseudorandom Functions using Elliptic Curves
EC-OPRF: Oblivious Pseudorandom Functions using Elliptic Curves
复制标题
EC-OPRF：使用椭圆曲线的不经意的伪随机函数
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Brian Vohaska
中科院分区：
文献类型：
--
作者：
Jonathan Burns;Daniel Moore;Katrina Ray;Ryan Speers;Brian Vohaska
我们引入了一个安全的椭圆曲线不经意伪随机函数（EC-OPRF），它通过将字符串散列到椭圆曲线上来提供一个简单有效的机制来计算不经意伪随机函数（OPRF）。EC-OPRF协议使半可信服务器能够从客户端接收一组加密掩蔽的椭圆曲线点，用私钥保护这些点，并将结果集返回给客户端进行解密。我们还介绍了扩展和概括这个计划，包括一个新的机制，提供前向保密，并讨论了每个变种的安全性和计算复杂性。EC-OPRF协议及其变体之一的实现基准测试提供，沿着与原始协议的测试向量。
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.