Cited By
View all- Wong HMa JYin HChow S(2023)How (Not) to Build Threshold EdDSAProceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses10.1145/3607199.3607230(123-134)Online publication date: 16-Oct-2023
Multi-key leakage-resilient threshold cryptography
Authors: 
Cong Zhang, Tsz Hon Yuen, Hao Xiong, Sherman S.M. Chow, Siu Ming Yiu, Yi-Jun HeAuthors Info & Claims
Pages 61 - 70
Abstract
With the goal of ensuring availability of security services such as encryption and authentication, we initiate the study of leakage-resilient threshold cryptography, for achieving formal security guarantee under various key-exposure attacks. A distinctive property of threshold cryptosystems is that a threshold number of secret keys are used in the main cryptographic function such as decryption or signing. Even though some existing security models allow leakages of multiple keys of different users, these keys are not used simultaneously to decrypt a ciphertext or sign a message.
In this paper, we introduce the multi-key leakage-resilient security model for threshold cryptography. We also propose constructions with formal security guarantee with respect to our model, one is a dynamic threshold public key encryption scheme and another is a threshold ring signature scheme.
References
[1]
A. Akavia, S. Goldwasser, and C. Hazay. Distributed public key schemes secure against continual leakage. In PODC, pages 155--164, 2012.
[2]
A. Akavia, S. Goldwasser, and V. Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks. In TCC, volume 5444 of LNCS, pages 474--495. Springer, 2009.
[3]
J. Alwen, Y. Dodis, M. Naor, G. Segev, S. Walfish, and D. Wichs. Public-key encryption in the bounded-retrieval model. In EUROCRYPT, volume 6110 of LNCS, pages 113--134. Springer, 2010.
[4]
D. Boneh and X. Boyen. Secure identity based encryption without random oracles. In CRYPTO, volume 3152 of LNCS, pages 443--459. Springer, 2004.
[5]
E. Boyle, G. Segev, and D. Wichs. Fully leakage-resilient signatures. In EUROCRYPT, volume 6632 of LNCS, pages 89--108. Springer, 2011.
[6]
Z. Brakerski, Y. T. Kalai, J. Katz, and V. Vaikuntanathan. Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In FOCS, pages 501--510. IEEE, 2010.
[7]
E. Bresson, J. Stern, and M. Szydlo. Threshold ring signatures and applications to ad-hoc groups. In CRYPTO, volume 2442 of LNCS, pages 465--480. Springer, 2002.
[8]
S. S. M. Chow, Y. Dodis, Y. Rouselakis, and B. Waters. Practical leakage-resilient identity-based encryption from simple assumptions. In CCS, pages 152--161. ACM, 2010.
[9]
C. Delerablee and D. Pointcheval. Dynamic threshold public-key encryption. In CRYPTO, volume 5157 of LNCS, pages 317--334. Springer, 2008.
[10]
Y. Dodis, S. Goldwasser, Y. T. Kalai, C. Peikert, and V. Vaikuntanathan. Public-key encryption schemes with auxiliary inputs. In TCC, volume 5978 of LNCS, pages 361--381. Springer, 2010.
[11]
Y. Dodis, K. Haralambiev, A. Lopez-Alt, and D. Wichs. Cryptography against continuous memory attacks. In FOCS, pages 511--520. IEEE, 2010.
[12]
Y. Dodis, A. B. Lewko, B. Waters, and D. Wichs. Storing secrets on continually leaky devices. In FOCS, pages 688--697, 2011.
[13]
A. B. Lewko, Y. Rouselakis, and B. Waters. Achieving leakage resilience through dual system encryption. In TCC, volume 6597 of LNCS, pages 70--88. Springer, 2011.
[14]
M. Naor and G. Segev. Public-key cryptosystems resilient to key leakage. In CRYPTO, volume 5677 of LNCS, pages 18--35. Springer, 2009.
[15]
B. Waters. Efficient identity-based encryption without random oracles. In EUROCRYPT, volume 3494 of LNCS, pages 114--127. Springer, 2005.
[16]
B. Waters. Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions. In CRYPTO, volume 5677 of LNCS, pages 619--636. Springer, 2009.
[17]
T. H. Yuen, S. S. M. Chow, Y. Zhang, and S. M. Yiu. Identity-based encryption resilient to continual auxiliary leakage. In EUROCRYPT, volume 7237 of LNCS, pages 117--134. Springer, 2012.
[18]
T. H. Yuen, J. K. Liu, M. H. Au, W. Susilo, and J. Zhou. Threshold ring signature without random oracles. In ASIACCS, pages 261--267. ACM, 2011.
[19]
T. H. Yuen, S. M. Yiu, and L. C. K. Hui. Fully leakage-resilient signatures with auxiliary inputs. In ACISP, volume 7372 of LNCS, pages 294--307. Springer, 2012.
Index Terms
- Multi-key leakage-resilient threshold cryptography
Recommendations
Leakage-resilient lossy trapdoor functions and public-key encryption
AsiaPKC '13: Proceedings of the first ACM workshop on Asia public-key cryptographyLossy Trapdoor Functions (LTFs) was introduced by Peikert and Waters in 2008. The importance of the LTFs was justified by their numerous cryptographic applications, like the construction of injective one-way trapdoor functions, CCA-secure public-key ...
Leakage-resilient CCA2-secure certificateless public-key encryption scheme without bilinear pairing
In practical applications, an encryption scheme should withstand various leakage attacks (e.g., side-channel attacks, cold-boot attacks, etc.). Thus, in this paper, a new leakage-resilient certificateless public-key encryption (LR-CL-PKE) scheme is ...
Leakage-Resilient Hybrid Signcryption in Heterogeneous Public-key Systems
Signcryption integrates both signature and encryption schemes into single scheme to ensure both content unforgeability (authentication) and message confidentiality while reducing computational complexity. Typically, both signers (senders) and decrypters (...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2013
574 pages
ISBN:9781450317672
DOI:10.1145/2484313
- General Chairs:
- Kefei Chen,
- Qi Xie,
- Weidong Qiu,
- Program Chairs:
- Ninghui Li,
- Wen-Guey Tzeng
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 May 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
ASIA CCS '13
Sponsor:
ASIA CCS '13: 8th ACM Symposium on Information, Computer and Communications Security
May 8 - 10, 2013
Hangzhou, China
Acceptance Rates
ASIA CCS '13 Paper Acceptance Rate 35 of 216 submissions, 16%;
Overall Acceptance Rate 418 of 2,322 submissions, 18%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 300Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)1
Reflects downloads up to 12 Dec 2024
Other Metrics
Citations
Cited By
View all- Wong HMa JYin HChow S(2023)How (Not) to Build Threshold EdDSAProceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses10.1145/3607199.3607230(123-134)Online publication date: 16-Oct-2023
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in