Cited by 49Cryptography and Data SecurityAdvanced Authentication Protocols SecurityUser Authentication and Security Systems

The DOI matches its Crossref record; the references it cites are not checked yet.

PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server

Open access
Baum, Carsten, Frederiksen, Tore, Hesse, Julia, Lehmann, Anja, Yanai, Avishay·2020·2020 IEEE European Symposium on Security and Privacy (EuroS&P)

Abstract

Single Sign-On (SSO) is becoming an increasingly popular authentication method for users that leverages a trusted Identity Provider (IdP) to bootstrap secure authentication tokens from a single user password. It alleviates some of the worst security issues of passwords, as users no longer need to memorize individual passwords for all service providers, and it removes the burden of these service to properly protect huge password databases. However, SSO also introduces a single point of failure. If compromised, the IdP can impersonate all users and learn their master passwords. To remedy this risk while preserving the advantages of SSO, Agrawal et al. (CCS'18) recently proposed a distributed realization termed PASTA (password-authenticated threshold authentication) which splits the role of the IdP across n servers. While PASTA is a great step forward and guarantees security as long as not all servers are corrupted, it uses a rather inflexible corruption model: servers cannot be corrupted adaptively and - even worse - cannot recover from corruption. The latter is known as proactive security and allows servers to re-share their keys, thereby rendering all previously compromised information useless. In this work, we improve upon the work of PASTA and propose a distributed SSO protocol with proactive and adaptive security (PESTO), guaranteeing security as long as not all servers are compromised at the same time. We prove our scheme secure in the UC framework which is known to provi…

Overview

Integrity signals

Registry

Crossref · 10.1109/eurosp48549.2020.00044

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • It is not possible to brute force attack user passwords because of the partially-oblivious distributed pseudo-random functions used for distributed password authentication.

    “Moreover, it is not possible to brute force attack user passwords because of the partially-oblivious distributed pseudo-random functions [37] used for distributed password authentication.”

Citations

The citation lists haven’t been fetched yet

References 35 · Cited by 49

Research works printed but not linked: 45

  1. 10.1007/978-3-662-44381-1_15 · DOI
  2. 10.1007/978-3-319-78372-7_15 · DOI
  3. 10.1007/s00145-004-0314-9 · DOI
  4. jarecki, 2018, Threshold partially-oblivious prfs with applications to key management, ePrint Archive 2018/733
  5. 10.1145/2382196.2382252 · DOI
  6. 10.1007/978-3-540-30576-7_28 · DOI
  7. 10.1145/2810103.2813722 · DOI
  8. 10.1007/978-3-540-85230-8_20 · DOI
  9. 10.1007/978-3-662-45608-8_13 · DOI
  10. 10.1007/3-540-45353-9_26 · DOI
  11. baum, 2019, PESTO Proactively secure distributed single sign-on or how to trust a hacked server
  12. jarecki, 2017, Toppss: Cost-minimal password-protected secret sharing based on threshold oprf, ACNS, 39
  13. 10.1145/2046707.2046758 · DOI
  14. 10.1109/EuroSP.2016.30 · DOI
  15. 0, Shibboleth
  16. 0, PESTO open source implementation
  17. 10.1109/CSFW.2004.1310743 · DOI
  18. mackenzie, 2002, Threshold password-authenticated key exchange, Crypto, 385
  19. canetti, 2000, Universally composable security: A new paradigm for cryptographic protocols, Eprint, 67
  20. 10.1007/11426639_24 · DOI
  21. canetti, 1999, Adaptive security for threshold cryptosystems, Crypto, 98
  22. 10.1109/SFCS.1997.646127 · DOI
  23. scott, 2019, The miracl core cryptographic library
  24. frankel, 1989, A practical protocol for large group oriented networks, Eurocrypt, 56
  25. 10.1145/195058.195405 · DOI
  26. 10.1145/237814.237998 · DOI
  27. frankel, 1997, Proactive RSA, Crypto, 440
  28. 10.1007/978-3-540-30574-3_16 · DOI
  29. 10.1007/s10207-006-0011-9 · DOI
  30. 10.1007/BFb0055722 · DOI
  31. 10.1145/112600.112605 · DOI
  32. 10.1109/ENABL.2000.883724 · DOI
  33. sakimura, 0, OpenID Connect Core 1 0 incorporating errata set 1
  34. everspaugh, 2015, The pythia prf service, USENIX, 547
  35. 10.1007/3-540-39200-9_32 · DOI
  36. gennaro, 1996, Robust and efficient sharing of RSA functions, Crypto, 157
  37. 10.1007/3-540-44586-2_18 · DOI
  38. 10.1145/3243734.3243839 · DOI
  39. 2019, Password data for 2 2 million users of currency and gaming sites dumped online
  40. almansa, 2006, Simplified threshold RSA with adaptive and proactive security, Eurocrypt, 593
  41. 2016, 117 million linkedin emails and passwords from a 2012 hack just got posted online
  42. 0, Security Assertion Markup Language (SAML) V2 0 Technical Overview
  43. 2019, Forum cracks the vintage passwords of ken thompson and other unix pioneers
  44. 2016, Hack brief 4-year-old dropbox hack exposed 68 million people's data
  45. o'flaherty, 2019, Collection 1 breach - how to find out if your password has been stolen, Forbes

Metadata

Authors
Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., & Yanai, A.
Affiliations
  • Aarhus University (DK)
  • Alexandra Institute (Denmark) (DK)
  • IBM Research - Zurich (CH)
  • Hasso Plattner Institute (DE)
  • VMware (United States) (US)
Venue
2020 IEEE European Symposium on Security and Privacy (EuroS&P)
Publisher
IEEE
Published
2020-09
Volume
2019
Pages
587-606
OpenAlex
W3003831591
Cited by
49
References
35
Citations by year
2026: 3 · 2025: 13 · 2024: 12 · 2023: 9 · 2022: 5 · 2021: 5 · 2020: 2
FWCI
2.01
Type
conference paper
Language
en
Open access
Locations
  • IEEE European Symposium on Security and Privacy (publishedVersion)
  • IACR Cryptology ePrint Archive (submittedVersion)
  • Scopus (Elsevier) (submittedVersion, other-oa)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
  • Physical Sciences › Computer Science › Information Systems › User Authentication and Security Systems
Keywords
single sign-on, distributed authentication, proactive security, adaptive corruptions, pasta, pesto, two-round protocols, RSA assumption

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review