Threshold Signatures with Private Accountability

被引:21
作者
Boneh, Dan [1 ]
Komlo, Chelsea [2 ]
机构
[1] Stanford Univ, Stanford, CA USA
[2] Univ Waterloo, Waterloo, ON, Canada
来源
ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT IV | 2022年 / 13510卷
关键词
RING SIGNATURES; IDENTIFICATION; CONSTRUCTION; SCHEME;
D O I
10.1007/978-3-031-15985-5_19
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Existing threshold signature schemes come in two flavors: (i) fully private, where the signature reveals nothing about the set of signers that generated the signature, and (ii) accountable, where the signature completely identifies the set of signers. In this paper we propose a new type of threshold signature, called TAPS, that is a hybrid of privacy and accountability. A TAPS signature is fully private from the public's point of view. However, an entity that has a secret tracing key can trace a signature to the threshold of signers that generated it. A TAPS makes it possible for an organization to keep its inner workings private, while ensuring that signers are accountable for their actions. We construct a number of TAPS schemes. First, we present a generic construction that builds a TAPS from any accountable threshold signature. This generic construction is not efficient, and we next focus on efficient schemes based on standard assumptions. We build two efficient TAPS schemes (in the random oracle model) based on the Schnorr signature scheme. We conclude with a number of open problems relating to efficient TAPS.
引用
收藏
页码:551 / 581
页数:31
相关论文
共 59 条
[1]  
Andresen G., 2011, Bitcoin improvement proposal (BIP) 0011
[2]  
[Anonymous], 1992, Lecture Notes in Computer Science
[3]   Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics [J].
Attema, Thomas ;
Cramer, Ronald .
ADVANCES IN CRYPTOLOGY - CRYPTO 2020, PT III, 2020, 12172 :513-543
[4]  
Attema Thomas., 2021, Cryptology ePrint Archive
[5]  
Au MH, 2006, LECT NOTES COMPUT SC, V4043, P101
[6]  
Bagherzandi A, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P449
[7]  
Beimel Amos, 2011, Coding and Cryptology. Proceedings of the Third International Workshop, IWCC 2011, P11, DOI 10.1007/978-3-642-20901-7_2
[8]   Two-tier signatures from the Fiat-Shamir transform, with applications to strongly unforgeable and one-time signatures [J].
Bellare, M. ;
Shoup, S. .
IET INFORMATION SECURITY, 2008, 2 (02) :47-63
[9]  
Bellare M, 2003, LECT NOTES COMPUT SC, V2656, P614
[10]  
Bellare M., 2006, P 13 ACM C COMP COMM, P390, DOI DOI 10.1145/1180405.1180453