abstract

Brief announcement: optimal amortized secret sharing with cheater identification

Author:

Ashish ChoudhuryAuthors Info & Claims

PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing

Pages 101 - 102

https://doi.org/10.1145/2332432.2332453

Published: 16 July 2012 Publication History

Get Access

Abstract

We consider the problem of k-out-of-n secret sharing, capable of identifying up to t cheaters, with probability at least (1 - ε), for a given error parameter ε. In any such secret sharing scheme, t < k/2 and the lower bound of |V_i| ≥ |S| - 1 / ε + 1 holds. Here V_i denotes the set of all possible i^th share, that can be assigned to the i^th party and S denotes the set of all possible secrets. To the best of our knowledge, there does not exist any computationally efficient secret sharing scheme with k = 2t+1 (the minimum value of k), where |V_i| exactly matches the lower bound. We show that it is possible to match this bound in the amortized sense.

References

[1]

T. Johansson, G. Kabatianskii, and B. J. M. Smeets. On the relation between A-codes and codes correcting independent errors. In EUROCRYPT, pages 1--11, 1993.

Digital Library

Google Scholar

[2]

K. Kurosawa, S. Obana, and W. Ogata. t-cheater identifiable (k, n) threshold secret sharing schemes. In CRYPTO, pages 410--423, 1995.

Digital Library

Google Scholar

[3]

R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed Solomon codes. Communications of the ACM, 24(9):583--584, 1981.

Digital Library

Google Scholar

[4]

S. Obana. Almost optimum t-cheater identifiable secret sharing schemes. In EUROCRYPT, pages 284--302, 2011.

Digital Library

Google Scholar

[5]

A. Shamir. How to share a secret. Communications of the ACM, 22(11):612--613, 1979.

Digital Library

Google Scholar

Cited By

View all

Roy PDutta SMorozov KAdhikari AFukushima KKiyomoto SSakurai K(2018)Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and RobustnessInformation Security Practice and Experience10.1007/978-3-319-99807-7_37(578-594)Online publication date: 6-Sep-2018
https://doi.org/10.1007/978-3-319-99807-7_37
Pramanik JRoy PDutta SAdhikari ASakurai K(2018)Secret Sharing Schemes on Compartmental Access Structure in Presence of CheatersInformation Systems Security10.1007/978-3-030-05171-6_9(171-188)Online publication date: 5-Dec-2018
https://doi.org/10.1007/978-3-030-05171-6_9
XU RMOROZOV KTAKAGI T(2017)Secret Sharing with Cheaters Using Multi-Receiver AuthenticationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E100.A.115E100.A:1(115-125)Online publication date: 2017
https://doi.org/10.1587/transfun.E100.A.115
Show More Cited By

Index Terms

Brief announcement: optimal amortized secret sharing with cheater identification
1. Security and privacy
  1. Cryptography
  2. Systems security
    1. Operating systems security

Recommendations

Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency
Information Systems Security
Abstract
A (k, L, n) ramp secret sharing scheme allows a dealer to share a secret vector with a lesser share size compared to threshold secret sharing schemes. In this work, we formalize the definition of cheating in ramp secret sharing schemes and propose ... $^{}$
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

In a secret sharing scheme a dealer shares a secret s among n parties such that an adversary corrupting up to t parties does not learn s, while any t+1 parties can efficiently recover s. Over a long period of time all parties may be corrupted thus ...
Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing
Cryptology and Network Security
Abstract
Cheating detectable secret sharing schemes (CDSS) detects changes in the secret that is caused by an adversary who modifies shares of an unauthorized subset of participants. We consider leakage resilient cheating detectable secret sharing schemes (...

Comments

Information & Contributors

Information

Published In

PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing

July 2012

410 pages

ISBN:9781450314503

DOI:10.1145/2332432

General Chair:
Darek Kowalski
U. of Liverpool, UK and IMDEA Networks, Spain
,
Program Chair:
Alessandro Panconesi
Sapienza, University of Rome, Italy

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 July 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

information theoretic security

Qualifiers

Abstract

Conference

PODC '12

Sponsor:

SIGOPS
SIGACT
INESC-ID

PODC '12: ACM Symposium on Principles of Distributed Computing

July 16 - 18, 2012

Madeira, Portugal

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
187
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Roy PDutta SMorozov KAdhikari AFukushima KKiyomoto SSakurai K(2018)Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and RobustnessInformation Security Practice and Experience10.1007/978-3-319-99807-7_37(578-594)Online publication date: 6-Sep-2018
https://doi.org/10.1007/978-3-319-99807-7_37
Pramanik JRoy PDutta SAdhikari ASakurai K(2018)Secret Sharing Schemes on Compartmental Access Structure in Presence of CheatersInformation Systems Security10.1007/978-3-030-05171-6_9(171-188)Online publication date: 5-Dec-2018
https://doi.org/10.1007/978-3-030-05171-6_9
XU RMOROZOV KTAKAGI T(2017)Secret Sharing with Cheaters Using Multi-Receiver AuthenticationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E100.A.115E100.A:1(115-125)Online publication date: 2017
https://doi.org/10.1587/transfun.E100.A.115
Adhikari AMorozov KObana SRoy PSakurai KXu R(2016)Efficient Threshold Secret Sharing Schemes Secure Against Rushing CheatersInformation Theoretic Security10.1007/978-3-319-49175-2_1(3-23)Online publication date: 10-Nov-2016
https://doi.org/10.1007/978-3-319-49175-2_1
Roy PAdhikari AXu RMorozov KSakurai K(2014)An Efficient Robust Secret Sharing Scheme with Optimal Cheater ResiliencySecurity, Privacy, and Applied Cryptography Engineering10.1007/978-3-319-12060-7_4(47-58)Online publication date: 2014
https://doi.org/10.1007/978-3-319-12060-7_4
Obana STsuchida K(2014)Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite FieldAdvances in Information and Computer Security10.1007/978-3-319-09843-2_7(88-97)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09843-2_7
Xu RMorozov KTakagi T(2014)Cheater Identifiable Secret Sharing Schemes via Multi-Receiver AuthenticationAdvances in Information and Computer Security10.1007/978-3-319-09843-2_6(72-87)Online publication date: 2014
https://doi.org/10.1007/978-3-319-09843-2_6
Xu RMorozov KTakagi T(2013)On Cheater Identifiable Secret Sharing Schemes Secure against Rushing AdversaryAdvances in Information and Computer Security10.1007/978-3-642-41383-4_17(258-271)Online publication date: 2013
https://doi.org/10.1007/978-3-642-41383-4_17
Jhanwar MSafavi-Naini R(2013)On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating DetectionProceedings of the 14th International Conference on Progress in Cryptology INDOCRYPT 2013 - Volume 825010.1007/978-3-319-03515-4_12(179-196)Online publication date: 7-Dec-2013
https://dl.acm.org/doi/10.1007/978-3-319-03515-4_12

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency

Brief Announcement: Proactive Secret Sharing with a Dishonest Majority

Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tag

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency

Brief Announcement: Proactive Secret Sharing with a Dishonest Majority

Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tag

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations