ZKlaims: Privacy-preserving Attribute-based Credentials using Non-interactive Zero-knowledge Techniques

被引：11

作者：

Schanzenbach, Martin ^{[1
]}

Kilian, Thomas ^{[1
]}

Schuette, Julian ^{[1
]}

Banse, Christian ^{[1
]}

机构：

[1] Fraunhofer AISEC, Pk Ring 4, Garching, Germany

来源：

PROCEEDINGS OF THE 16TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS, VOL 2: SECRYPT | 2019年

关键词：

Zero-Knowledge; Attribute-based Credentials; Privacy; Identity and Access Management;

D O I：

10.5220/0007772903250332

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we present ZKlaims: a system that allows users to present attribute-based credentials in a privacy-preserving way. We achieve a zero-knowledge property on the basis of Succinct Non-interactive Arguments of Knowledge (SNARKs). ZKlaims allow users to prove statements on credentials issued by trusted third parties. The credential contents are never revealed to the verifier as part of the proving process. Further, ZKlaims can be presented non-interactively, mitigating the need for interactive proofs between the user and the verifier. This allows ZKlaims to be exchanged via fully decentralized services and storages such as traditional peer-to-peer networks based on distributed hash tables (DHTs) or even blockchains. To show this, we include a performance evaluation of ZKlaims and show how it can be integrated in decentralized identity provider services.

引用

页码：325 / 332

页数：8

共 14 条

[1]

[Anonymous], 2018, New York Times

[2]

[Anonymous], 2002, P 9 ACM C COMPUTER C

[3]

Ben-Sasson E, 2013, LECT NOTES COMPUT SC, V8043, P90, DOI 10.1007/978-3-642-40084-1_6

[4] DecentID: Decentralized and Privacy-preserving Identity Storage System using Smart Contracts [J].

Friebe, Sebastian ;

Sobik, Ingo ;

Zitterbart, Martina .

2018 17TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (IEEE TRUSTCOM) / 12TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING (IEEE BIGDATASE), 2018, :37-42

[5] On the Size of Pairing-Based Non-interactive Arguments [J].

Groth, Jens .

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 :305-326

[6] UnlimitID: Privacy-Preserving Federated Identity Management using Algebraic MACs [J].

Isaakidis, Marios ;

Halpin, Harry ;

Danezis, George .

PROCEEDINGS OF THE 2016 ACM WORKSHOP ON PRIVACY IN THE ELECTRONIC SOCIETY (WPES'16), 2016, :139-142

[7]

Paquin C., 2011, Microsoft Corporation Draft Revision, V1

[8] Pinocchio: Nearly Practical Verifiable Computation [J].

Parno, Bryan ;

Howell, Jon ;

Gentry, Craig ;

Raykova, Mariana .

2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2013, :238-252

[9]

Sakimura N., 2014, OpenID connect core 1.0

[10]

Schanzenbach M., 2018, P INT C TRUST SEC PR

← 1 2 →