TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF

Stanisław Jarecki; Aggelos Kiayias; Hugo Krawczyk; Jiayu Xu

doi:10.1007/978-3-319-61204-1_3

TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF

Stanisław Jarecki, Aggelos Kiayias, Hugo Krawczyk, Jiayu Xu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We present TOPPSS, the most efficient Password-Protected Secret Sharing (PPSS) scheme to date. A (t, n)-threshold PPSS, introduced by Bagherzandi et al. [4], allows a user to share a secret among n servers so that the secret can later be reconstructed by the user from any subset of t+1t+1 servers with the sole knowledge of a password. It is guaranteed that any coalition of up to t corrupt servers learns nothing about the secret (or the password). In addition to providing strong protection to secrets stored online, PPSS schemes give rise to efficient Threshold PAKE (T-PAKE) protocols that armor single-server password authentication against the inherent vulnerability to offline dictionary attacks in case of server compromise.

TOPPSS is password-only, i.e. it does not rely on public keys in reconstruction, and enjoys remarkable efficiency: A single communication round, a single exponentiation per server and just two exponentiations per client regardless of the number of servers. TOPPSS satisfies threshold security under the (Gap) One-More Diffie-Hellman (OMDH) assumption in the random-oracle model as in prior efficient realizations of PPSS/T-PAKE [18, 19]. Moreover, we show that TOPPSS realizes the Universally Composable PPSS notion of [19] under a generalization of OMDH, the Threshold One-More Diffie-Hellman (T-OMDH) assumption. We show that the T-OMDH and OMDH assumptions are both hard in the generic group model.

The key technical tool we introduce is a universally composable Threshold Oblivious PRF which is of independent interest and applicability.

Original language	English
Title of host publication	Applied Cryptography and Network Security
Subtitle of host publication	15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings
Editors	Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi
Place of Publication	Cham
Publisher	Springer, Cham
Pages	39-58
Number of pages	20
ISBN (Electronic)	978-3-319-61204-1
ISBN (Print)	978-3-319-61203-4
DOIs	https://doi.org/10.1007/978-3-319-61204-1_3
Publication status	Published - 26 Jun 2017
Event	15th International Conference on Applied Cryptography and Network Security - Kanazawa, Japan Duration: 10 Jul 2017 → 12 Jul 2017 https://cy2sec.comm.eng.osaka-u.ac.jp/acns2017/index.html

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer, Cham
Volume	10355
ISSN (Print)	0302-9743

Conference

Conference	15th International Conference on Applied Cryptography and Network Security
Abbreviated title	ACNS 2017
Country/Territory	Japan
City	Kanazawa
Period	10/07/17 → 12/07/17
Internet address	https://cy2sec.comm.eng.osaka-u.ac.jp/acns2017/index.html

Access to Document

10.1007/978-3-319-61204-1_3

https://link.springer.com/chapter/10.1007%2F978-3-319-61204-1_3

Panoramix:Privacy and Accountability in Networks via Optimized Randomized Mix-nets
Kiayias, A.
EU government bodies
1/09/15 → 31/01/19
Project: Research

Cite this

Jarecki, S., Kiayias, A., Krawczyk, H., & Xu, J. (2017). TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. In D. Gollmann, A. Miyaji, & H. Kikuchi (Eds.), Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings (pp. 39-58). (Lecture Notes in Computer Science; Vol. 10355). Springer, Cham. https://doi.org/10.1007/978-3-319-61204-1_3

Jarecki, Stanisław ; Kiayias, Aggelos ; Krawczyk, Hugo et al. / TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. editor / Dieter Gollmann ; Atsuko Miyaji ; Hiroaki Kikuchi. Cham : Springer, Cham, 2017. pp. 39-58 (Lecture Notes in Computer Science).

@inproceedings{bca12c5e460f4bc08bf3ef88db426e92,

title = "TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF",

abstract = "We present TOPPSS, the most efficient Password-Protected Secret Sharing (PPSS) scheme to date. A (t, n)-threshold PPSS, introduced by Bagherzandi et al. [4], allows a user to share a secret among n servers so that the secret can later be reconstructed by the user from any subset of t+1t+1 servers with the sole knowledge of a password. It is guaranteed that any coalition of up to t corrupt servers learns nothing about the secret (or the password). In addition to providing strong protection to secrets stored online, PPSS schemes give rise to efficient Threshold PAKE (T-PAKE) protocols that armor single-server password authentication against the inherent vulnerability to offline dictionary attacks in case of server compromise.TOPPSS is password-only, i.e. it does not rely on public keys in reconstruction, and enjoys remarkable efficiency: A single communication round, a single exponentiation per server and just two exponentiations per client regardless of the number of servers. TOPPSS satisfies threshold security under the (Gap) One-More Diffie-Hellman (OMDH) assumption in the random-oracle model as in prior efficient realizations of PPSS/T-PAKE [18, 19]. Moreover, we show that TOPPSS realizes the Universally Composable PPSS notion of [19] under a generalization of OMDH, the Threshold One-More Diffie-Hellman (T-OMDH) assumption. We show that the T-OMDH and OMDH assumptions are both hard in the generic group model.The key technical tool we introduce is a universally composable Threshold Oblivious PRF which is of independent interest and applicability.",

author = "Stanis{\l}aw Jarecki and Aggelos Kiayias and Hugo Krawczyk and Jiayu Xu",

year = "2017",

month = jun,

day = "26",

doi = "10.1007/978-3-319-61204-1_3",

language = "English",

isbn = "978-3-319-61203-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Cham",

pages = "39--58",

editor = "Dieter Gollmann and Atsuko Miyaji and Hiroaki Kikuchi",

booktitle = "Applied Cryptography and Network Security",

note = "15th International Conference on Applied Cryptography and Network Security, ACNS 2017 ; Conference date: 10-07-2017 Through 12-07-2017",

url = "https://cy2sec.comm.eng.osaka-u.ac.jp/acns2017/index.html",

}

Jarecki, S, Kiayias, A, Krawczyk, H & Xu, J 2017, TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. in D Gollmann, A Miyaji & H Kikuchi (eds), Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10355, Springer, Cham, Cham, pp. 39-58, 15th International Conference on Applied Cryptography and Network Security, Kanazawa, Japan, 10/07/17. https://doi.org/10.1007/978-3-319-61204-1_3

TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. / Jarecki, Stanisław; Kiayias, Aggelos; Krawczyk, Hugo et al.

Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. ed. / Dieter Gollmann; Atsuko Miyaji; Hiroaki Kikuchi. Cham : Springer, Cham, 2017. p. 39-58 (Lecture Notes in Computer Science; Vol. 10355).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF

AU - Jarecki, Stanisław

AU - Kiayias, Aggelos

AU - Krawczyk, Hugo

AU - Xu, Jiayu

PY - 2017/6/26

Y1 - 2017/6/26

N2 - We present TOPPSS, the most efficient Password-Protected Secret Sharing (PPSS) scheme to date. A (t, n)-threshold PPSS, introduced by Bagherzandi et al. [4], allows a user to share a secret among n servers so that the secret can later be reconstructed by the user from any subset of t+1t+1 servers with the sole knowledge of a password. It is guaranteed that any coalition of up to t corrupt servers learns nothing about the secret (or the password). In addition to providing strong protection to secrets stored online, PPSS schemes give rise to efficient Threshold PAKE (T-PAKE) protocols that armor single-server password authentication against the inherent vulnerability to offline dictionary attacks in case of server compromise.TOPPSS is password-only, i.e. it does not rely on public keys in reconstruction, and enjoys remarkable efficiency: A single communication round, a single exponentiation per server and just two exponentiations per client regardless of the number of servers. TOPPSS satisfies threshold security under the (Gap) One-More Diffie-Hellman (OMDH) assumption in the random-oracle model as in prior efficient realizations of PPSS/T-PAKE [18, 19]. Moreover, we show that TOPPSS realizes the Universally Composable PPSS notion of [19] under a generalization of OMDH, the Threshold One-More Diffie-Hellman (T-OMDH) assumption. We show that the T-OMDH and OMDH assumptions are both hard in the generic group model.The key technical tool we introduce is a universally composable Threshold Oblivious PRF which is of independent interest and applicability.

AB - We present TOPPSS, the most efficient Password-Protected Secret Sharing (PPSS) scheme to date. A (t, n)-threshold PPSS, introduced by Bagherzandi et al. [4], allows a user to share a secret among n servers so that the secret can later be reconstructed by the user from any subset of t+1t+1 servers with the sole knowledge of a password. It is guaranteed that any coalition of up to t corrupt servers learns nothing about the secret (or the password). In addition to providing strong protection to secrets stored online, PPSS schemes give rise to efficient Threshold PAKE (T-PAKE) protocols that armor single-server password authentication against the inherent vulnerability to offline dictionary attacks in case of server compromise.TOPPSS is password-only, i.e. it does not rely on public keys in reconstruction, and enjoys remarkable efficiency: A single communication round, a single exponentiation per server and just two exponentiations per client regardless of the number of servers. TOPPSS satisfies threshold security under the (Gap) One-More Diffie-Hellman (OMDH) assumption in the random-oracle model as in prior efficient realizations of PPSS/T-PAKE [18, 19]. Moreover, we show that TOPPSS realizes the Universally Composable PPSS notion of [19] under a generalization of OMDH, the Threshold One-More Diffie-Hellman (T-OMDH) assumption. We show that the T-OMDH and OMDH assumptions are both hard in the generic group model.The key technical tool we introduce is a universally composable Threshold Oblivious PRF which is of independent interest and applicability.

U2 - 10.1007/978-3-319-61204-1_3

DO - 10.1007/978-3-319-61204-1_3

M3 - Conference contribution

SN - 978-3-319-61203-4

T3 - Lecture Notes in Computer Science

SP - 39

EP - 58

BT - Applied Cryptography and Network Security

A2 - Gollmann, Dieter

A2 - Miyaji, Atsuko

A2 - Kikuchi, Hiroaki

PB - Springer, Cham

CY - Cham

T2 - 15th International Conference on Applied Cryptography and Network Security

Y2 - 10 July 2017 through 12 July 2017

ER -

Jarecki S, Kiayias A, Krawczyk H, Xu J. TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF. In Gollmann D, Miyaji A, Kikuchi H, editors, Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. Cham: Springer, Cham. 2017. p. 39-58. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-61204-1_3

TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF

Abstract

Publication series

Conference

Access to Document

Fingerprint

Projects

Panoramix:Privacy and Accountability in Networks via Optimized Randomized Mix-nets

Cite this