Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices. / Albrecht, Martin; Davidson, Alex; Deo, Amit; Smart, Nigel P.

In: IACR Cryptology ePrint Archive, 01.11.2019.

Research output: Contribution to journalArticle

E-pub ahead of print

Standard

Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices. / Albrecht, Martin; Davidson, Alex; Deo, Amit; Smart, Nigel P.

In: IACR Cryptology ePrint Archive, 01.11.2019.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Albrecht M, Davidson A, Deo A, Smart NP. Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices. IACR Cryptology ePrint Archive. 2019 Nov 1.

Author

Albrecht, Martin ; Davidson, Alex ; Deo, Amit ; Smart, Nigel P. / Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices. In: IACR Cryptology ePrint Archive. 2019.

BibTeX

@article{dda006e62c2b4a4fa440a11c7e85dd25,
title = "Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices",
abstract = "Verifiable Oblivious Pseudorandom Functions (VOPRFs) are protocols that allow a client to learn verifiable pseudorandom function (PRF) evaluations on inputs of their choice. The PRF evaluations are computed by a server using their own secret key. The security of the protocol prevents both the server from learning anything about the client's input, and likewise the client from learning anything about the server's key. VOPRFs have many applications including password-based authentication, secret-sharing, anonymous authentication and efficient private set intersection. In this work, we construct the first round-optimal (online) VOPRF protocol that retains security from well-known lattice hardness assumptions. Our protocol requires constructions of non-interactive zero-knowledge arguments of knowledge (NIZKAoK). For analogues of Stern-type proofs in the lattice setting, we show that our VOPRF may be securely instantiated in the quantum random oracle model. We construct such arguments as extensions of prior work in the area of lattice-based zero-knowledge proof systems.",
author = "Martin Albrecht and Alex Davidson and Amit Deo and Smart, {Nigel P.}",
year = "2019",
month = nov,
day = "1",
language = "English",
journal = "IACR Cryptology ePrint Archive",

}

RIS

TY - JOUR

T1 - Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices

AU - Albrecht, Martin

AU - Davidson, Alex

AU - Deo, Amit

AU - Smart, Nigel P.

PY - 2019/11/1

Y1 - 2019/11/1

N2 - Verifiable Oblivious Pseudorandom Functions (VOPRFs) are protocols that allow a client to learn verifiable pseudorandom function (PRF) evaluations on inputs of their choice. The PRF evaluations are computed by a server using their own secret key. The security of the protocol prevents both the server from learning anything about the client's input, and likewise the client from learning anything about the server's key. VOPRFs have many applications including password-based authentication, secret-sharing, anonymous authentication and efficient private set intersection. In this work, we construct the first round-optimal (online) VOPRF protocol that retains security from well-known lattice hardness assumptions. Our protocol requires constructions of non-interactive zero-knowledge arguments of knowledge (NIZKAoK). For analogues of Stern-type proofs in the lattice setting, we show that our VOPRF may be securely instantiated in the quantum random oracle model. We construct such arguments as extensions of prior work in the area of lattice-based zero-knowledge proof systems.

AB - Verifiable Oblivious Pseudorandom Functions (VOPRFs) are protocols that allow a client to learn verifiable pseudorandom function (PRF) evaluations on inputs of their choice. The PRF evaluations are computed by a server using their own secret key. The security of the protocol prevents both the server from learning anything about the client's input, and likewise the client from learning anything about the server's key. VOPRFs have many applications including password-based authentication, secret-sharing, anonymous authentication and efficient private set intersection. In this work, we construct the first round-optimal (online) VOPRF protocol that retains security from well-known lattice hardness assumptions. Our protocol requires constructions of non-interactive zero-knowledge arguments of knowledge (NIZKAoK). For analogues of Stern-type proofs in the lattice setting, we show that our VOPRF may be securely instantiated in the quantum random oracle model. We construct such arguments as extensions of prior work in the area of lattice-based zero-knowledge proof systems.

M3 - Article

JO - IACR Cryptology ePrint Archive

JF - IACR Cryptology ePrint Archive

ER -