Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1007/978-3-642-04159-4_19guidebooksArticle/Chapter ViewAbstractPublication PagesBookacm-pubtype
chapter

Public Verifiability from Pairings in Secret Sharing Schemes

Published: 23 August 2009 Publication History

Abstract

In this paper we propose a new publicly verifiable secret sharing scheme using pairings with close relations to Shoenmakers' scheme. This scheme is efficient, multiplicatively homomorphic and with unconditional verifiability in the standard model. We formalize the notion of Indistinguishability of Secrets and prove that out scheme achieves it under the Decisional Bilinear Square (DBS) Assumption that is a natural variant of the Decisional Bilinear Diffie Hellman Assumption. Moreover, our scheme tolerates active and adaptive adversaries.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide books
Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers
August 2009
456 pages
ISBN:9783642041587
  • Editors:
  • Roberto Maria Avanzi,
  • Liam Keliher,
  • Francesco Sica

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 August 2009

Author Tags

  1. Pairings
  2. Public Verification
  3. Secret Sharing
  4. Semantic Security
  5. Threshold Cryptography

Qualifiers

  • Chapter

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Publicly Verifiable Secret Sharing Over Class Groups and Applications to DKG and YOSOAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_8(216-248)Online publication date: 26-May-2024
  • (2023)Cassiopeia: Practical On-Chain Witness EncryptionFinancial Cryptography and Data Security. FC 2023 International Workshops10.1007/978-3-031-48806-1_25(385-404)Online publication date: 1-May-2023
  • (2023)Mt. Random: Multi-tiered Randomness BeaconsApplied Cryptography and Network Security10.1007/978-3-031-33491-7_24(645-674)Online publication date: 19-Jun-2023
  • (2022)YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO ModelAdvances in Cryptology – ASIACRYPT 202210.1007/978-3-031-22963-3_22(651-680)Online publication date: 5-Dec-2022
  • (2022)Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of PartiesAdvances in Cryptology – EUROCRYPT 202210.1007/978-3-031-06944-4_16(458-487)Online publication date: 30-May-2022
  • (2020)ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret SharingAdvances in Cryptology – ASIACRYPT 202010.1007/978-3-030-64840-4_11(311-341)Online publication date: 7-Dec-2020
  • (2017)Secure publicly verifiable and proactive secret sharing schemes with general access structureInformation Sciences: an International Journal10.1016/j.ins.2016.10.040378:C(99-108)Online publication date: 1-Feb-2017
  • (2016)An efficient privacy-preserving aggregation and billing protocol for smart gridSecurity and Communication Networks10.1002/sec.16459:17(4536-4547)Online publication date: 25-Nov-2016
  • (2011)A practical (non-interactive) publicly verifiable secret sharing schemeProceedings of the 7th international conference on Information security practice and experience10.5555/2009103.2009130(273-287)Online publication date: 30-May-2011

View Options

View options

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media