[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1400751.1400856acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
demonstration

Mobile proactive secret sharing

Published: 18 August 2008 Publication History

Abstract

MPSS is a new way to do proactive secret sharing in asynchronous networks. MPSS provides mobility: The group of nodes holding the shares of the secret can change at each resharing, which is essential in a long-lived system. MPSS additionally allows the number of tolerated faulty shareholders to change when the secret is moved so that the system can tolerate more (or fewer) corruptions; this allows reconfiguration on the fly to accommodate changes in the environment.

References

[1]
C. Cachin, K. Kursawe, A. Lysyanskaya, and R. Strobl. Asynchronous verifiable secret sharing and proactive cryptosystems. In Proc. CCS 2002, pp. 88--97.
[2]
A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing, or how to cope with perpetual leakage. In CRYPTO '95, pp. 457--469.
[3]
D. Schultz. Mobile proactive secret sharing. In Master's Thesis, MIT, 2007.
[4]
L. Zhou, F. B. Schneider, and R. van Renesse. APSS: Proactive secret sharing in asynchronous systems. TISSEC, 8(3):259---286, Aug 2005.

Cited By

View all
  • (2023)Long live the honey badgerProceedings of the 32nd USENIX Conference on Security Symposium10.5555/3620237.3620540(5413-5430)Online publication date: 9-Aug-2023
  • (2023)State Machine Replication Under Changing Network ConditionsAdvances in Cryptology – ASIACRYPT 202210.1007/978-3-031-22963-3_23(681-710)Online publication date: 25-Jan-2023
  • (2022)Liberate Your Servers: A Decentralized Content Compliance Validation ProtocolData and Applications Security and Privacy XXXVI10.1007/978-3-031-10684-2_6(89-109)Online publication date: 13-Jul-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
August 2008
474 pages
ISBN:9781595939890
DOI:10.1145/1400751
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: 18 August 2008

Permissions

Request permissions for this article.

Check for updates

Author Tag

  1. proactive secret sharing byzantine

Qualifiers

  • Demonstration

Conference

PODC '08

Acceptance Rates

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

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)9
  • Downloads (Last 6 weeks)2
Reflects downloads up to 12 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Long live the honey badgerProceedings of the 32nd USENIX Conference on Security Symposium10.5555/3620237.3620540(5413-5430)Online publication date: 9-Aug-2023
  • (2023)State Machine Replication Under Changing Network ConditionsAdvances in Cryptology – ASIACRYPT 202210.1007/978-3-031-22963-3_23(681-710)Online publication date: 25-Jan-2023
  • (2022)Liberate Your Servers: A Decentralized Content Compliance Validation ProtocolData and Applications Security and Privacy XXXVI10.1007/978-3-031-10684-2_6(89-109)Online publication date: 13-Jul-2022
  • (2022)Mutual Accountability Layer: Accountable Anonymity Within Accountable TrustCyber Security, Cryptology, and Machine Learning10.1007/978-3-031-07689-3_24(318-336)Online publication date: 23-Jun-2022
  • (2022)Storing and Retrieving Secrets on a BlockchainPublic-Key Cryptography – PKC 202210.1007/978-3-030-97121-2_10(252-282)Online publication date: 27-Feb-2022
  • (2021)On Regenerating Codes and Proactive Secret Sharing: Relationships and ImplicationsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-91081-5_23(350-364)Online publication date: 9-Nov-2021
  • (2021)Improved Threshold Signatures, Proactive Secret Sharing, and Input Certification from LSS IsomorphismsProgress in Cryptology – LATINCRYPT 202110.1007/978-3-030-88238-9_19(382-404)Online publication date: 30-Sep-2021
  • (2020)Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof2020 IEEE Symposium on Security and Privacy (SP)10.1109/SP40000.2020.00052(859-876)Online publication date: May-2020
  • (2020)A proactive secret sharing scheme based on Chinese remainder theoremFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-019-9123-z15:2Online publication date: 2-Oct-2020
  • (2020)Can a Public Blockchain Keep a Secret?Theory of Cryptography10.1007/978-3-030-64375-1_10(260-290)Online publication date: 16-Nov-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media