Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices
| Autor: | Nigel P. Smart, Alex Davidson, Martin R. Albrecht, Amit Deo |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Public-Key Cryptography – PKC 2021-24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10–13, 2021, Proceedings, Part II Lecture Notes in Computer Science Lecture Notes in Computer Science-Public-Key Cryptography – PKC 2021 Public-Key Cryptography – PKC 2021 ISBN: 9783030752477 Public Key Cryptography (2) |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-030-75248-4_10 |
| Popis: | 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 subexponential lattice hardness assumptions. Our protocol requires constructions of non-interactive zero-knowledge arguments of knowledge (NIZKAoK). Using recent developments in the area of post-quantum zero-knowledge arguments of knowledge, 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|