Skip to main content
Springer Nature Link
Log in

Generalised Cumulative Arrays in Secret Sharing

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Cumulative arrays have played an important role in the early development of the secret sharing theory. They have not been subject to extensive study so far, as the secret sharing schemes built on them generally result in much larger sizes of shares, when compared with other conventional approaches. Recent works in threshold cryptography show that cumulative arrays may be the appropriate building blocks in non-homomorphic threshold cryptosystems where the conventional secret sharing methods are generally of no use. In this paper we study several extensions of cumulative arrays and show that some of these extensions significantly improve the performance of conventional cumulative arrays. In particular, we derive bounds on generalised cumulative arrays and show that the constructions based on perfect hash families are asymptotically optimal. We also introduce the concept of ramp perfect hash families as a generalisation of perfect hash families for the study of ramp secret sharing schemes and ramp cumulative arrays.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N Alon (1986) ArticleTitleExplicit construction of exponential sized families of k-independent sets Disc Maths 58 191–193 Occurrence Handle0588.05003 Occurrence Handle829076 Occurrence Handle10.1016/0012-365X(86)90161-5

    Article  MATH  MathSciNet  Google Scholar 

  2. N Alon M Naor (1996) ArticleTitleDerandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16 434–449 Occurrence Handle0857.68055 Occurrence Handle1407583 Occurrence Handle10.1007/BF01940874

    Article  MATH  MathSciNet  Google Scholar 

  3. H Alzer (1996) ArticleTitleA Proof of the Arithmetic Mean-Geometric Mean Inequality Am Math Mon 103 585 Occurrence Handle0867.26014 Occurrence Handle1404083 Occurrence Handle10.2307/2974672

    Article  MATH  MathSciNet  Google Scholar 

  4. M Atici SS Magliveras DR Stinson WD Wei (1996) ArticleTitleSome recursive constructions for perfect hash families J Comb Des 4 353–363 Occurrence Handle0914.68087 Occurrence Handle1402122 Occurrence Handle10.1002/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E

    Article  MATH  MathSciNet  Google Scholar 

  5. Beimel A, Stahl Y (2003) Robust information-theoretic private information retrieval. Third Conference on Security in Communication Networks ’02 September 12–13, 2002 Amalfi, Italy. Lect Notes Comput Sci 2576

  6. J Benaloh J Leichter (1988) ArticleTitleGeneralised secret sharing and monotone functions Adv Cryptol–CRYPTO ’88, LNCS 403 27–35 Occurrence Handle1046379

    MathSciNet  Google Scholar 

  7. GR Blakley (1979) ArticleTitleSafeguarding cryptographic keys Proceedings of AFIPS 1979 National Computer Conference 48 313–317

    Google Scholar 

  8. GR Blakley C Meadows (1985) ArticleTitleSecurity of ramp schemes Advances in Cryptology – Proceedings of CRYPTO ’84, Lect Notes Comput Sci 196 242–268 Occurrence Handle820021

    MathSciNet  Google Scholar 

  9. Blackburn SR (1999) Combinatorics and threshold cryptography. In: Combinatorial designs and their applications. Chapman and Hall/CRC Research Notes in Mathematics, 403, Holroyd, FC, Quinn KAS, Rowley C, Web BS (eds) CRC Press, London 49–70

  10. SR Blackburn (2000) ArticleTitlePerfect hash families: probabilistic methods and explicit constructions J Comb Theory A 92 54–60 Occurrence Handle0962.68042 Occurrence Handle1783938 Occurrence Handle10.1006/jcta.1999.3050

    Article  MATH  MathSciNet  Google Scholar 

  11. SR Blackburn M Burmester Y Desmedt PR Wild (1996) ArticleTitleEfficient multiplicative sharing schemes Advance in Cryptology–Eurocrypt ’96, LNCS 1070 107–118 Occurrence Handle1421582

    MathSciNet  Google Scholar 

  12. E Brickell G Di Crescenzo Y Frankel (2000) ArticleTitleSharing block ciphers Information Security Privacy, Lect Notes Comput Sci 1841 457–470 Occurrence Handle0963.94031

    MATH  Google Scholar 

  13. Cormen T, Leiserson C, Rivest R (1989) Introduction to algorithms. The MIT Press

  14. ZJ Czech G Havas BS Majewski (1997) ArticleTitlePerfect hashing Theor Comput Sci 182 1–143 Occurrence Handle0954.68060 Occurrence Handle1463931 Occurrence Handle10.1016/S0304-3975(96)00146-6

    Article  MATH  MathSciNet  Google Scholar 

  15. Y Desmedt Y Frankel (1989) ArticleTitleThreshold cryptosystems Advances in Cryptology – CRYPTO ’89, Lect Notes Comput Sci 435 307–315

    Google Scholar 

  16. P Erdös P Frankl Z Furedi (1985) ArticleTitleFamilies of finite sets in which no set is covered by the union of r others Israel J Math 51 79–89 Occurrence Handle0587.05021 Occurrence Handle804477

    MATH  MathSciNet  Google Scholar 

  17. ML Fredman J Komlòs (1984) ArticleTitleOn the size of separating systems and families of perfect hash functions SIAM J Alg Disc Methods 5 61–68 Occurrence Handle0525.68037

    MATH  Google Scholar 

  18. M Ito A Saito T Nishizeki (1993) ArticleTitleSecret sharing scheme realizing general access structure J Cryptol 6 15–20 Occurrence Handle0795.68070 Occurrence Handle1215354

    MATH  MathSciNet  Google Scholar 

  19. W-A Jackson KM Martin (1993) ArticleTitleCumulative arrays and geometric secret sharing schemes Adv Crypt Auscrypt ’92, Lect Notes Comput Sci 718 48–55 Occurrence Handle0869.94018 Occurrence Handle1292702

    MATH  MathSciNet  Google Scholar 

  20. W-A Jackson KM Martin (1994) ArticleTitleGeometric secret sharing schemes and their duals Des Codes Cryptogr 4 83–95 Occurrence Handle0794.94010 Occurrence Handle1260371 Occurrence Handle10.1007/BF01388562

    Article  MATH  MathSciNet  Google Scholar 

  21. W-A Jackson KM Martin (1996) ArticleTitleA combinatorial interpretation of ramp schemes Austr J Combinatorics 14 51–60 Occurrence Handle0862.94016 Occurrence Handle1424321

    MATH  MathSciNet  Google Scholar 

  22. WH Kautz RC Singleton (1964) ArticleTitleNonrandom binary superimposed codes IEEE Trans Inform Theory 10 363–377 Occurrence Handle0133.12402 Occurrence Handle10.1109/TIT.1964.1053689

    Article  MATH  Google Scholar 

  23. K Kurosawa K Okada K Sakano W Ogata S Tsujii (1993) ArticleTitleNon-perfect secret sharing schemes and matroids Adv Cryptol: Eurocrypt ’93, Lect Notes Comput Sci 765 126–141 Occurrence Handle1290333

    MathSciNet  Google Scholar 

  24. KM Martin R Safavi-Naini H Wang P Wild (2005) ArticleTitleDistributing the encryption and decryption of a block cipher Des Codes Cryptogr 36 263–287 Occurrence Handle2162579 Occurrence Handle10.1007/s10623-003-1719-4 Occurrence Handle1136.94322

    Article  MathSciNet  MATH  Google Scholar 

  25. KM Martin J Pieprzyk R Safavi-Naini H Wang P Wild (2003) ArticleTitleThreshold MACs. ICISC02, the 5th international conference on information security and Cryptology Lect Notes Comput Sci 2587 237–252 Occurrence Handle1031.94522 Occurrence Handle2080826 Occurrence Handle10.1007/3-540-36552-4_17

    Article  MATH  MathSciNet  Google Scholar 

  26. Mehlhorn K (1982) On the program size of perfect and universal hash functions. Proc. 23rd Annual IEEE Symposium on Foundations of Compute Science 170–175

  27. Mehlhorn K (1984) Data Structures and Algorithms, vol 1. Springer-Verlag

  28. S Micali R Sidney (1995) ArticleTitleA simple method for generating and sharing pseudo-random functions, with applications to clipper-like escrow systems Adv Cryptol CRYPTO ’95, Lect Notes Comput Sci 963 185–195 Occurrence Handle0868.94030

    MATH  Google Scholar 

  29. Ng S-L (2002) Generalised cumulative arrays. Manuscript

  30. W Ogata K Kurosawa (1998) ArticleTitleSome basic properties of general nonperfect secret sharing schemes J Univers Comput Sci 4 IssueID8 690–704 Occurrence Handle0967.68060 Occurrence Handle1654143

    MATH  MathSciNet  Google Scholar 

  31. A Shamir (1976) ArticleTitleHow to share a secret Communications ACM 22 612–613 Occurrence Handle549252 Occurrence Handle10.1145/359168.359176

    Article  MathSciNet  Google Scholar 

  32. GJ Simmons W-A Jackson K Martin (1991) ArticleTitleThe geometry of shared secret schemes Bull ICA 1 71–88 Occurrence Handle0826.94018 Occurrence Handle1103639

    MATH  MathSciNet  Google Scholar 

  33. RP Stanley (1997) Enumerative combinatorics, vol. 1 Cambridge University Press Cambridge, England Occurrence Handle0889.05001

    MATH  Google Scholar 

  34. DR Stinson (1992) ArticleTitleAn explication of secret sharing schemes Des Codes Cryptogr 2 357–390 Occurrence Handle0793.68111 Occurrence Handle1194776 Occurrence Handle10.1007/BF00125203

    Article  MATH  MathSciNet  Google Scholar 

  35. DR Stinson T Trung Particlevan R Wei (2000) ArticleTitleSecure frameproof codes, key distribution patterns, group testing algorithms and related structures J Statist Plan Infer 86 595–617 Occurrence Handle1054.94013 Occurrence Handle10.1016/S0378-3758(99)00131-7

    Article  MATH  Google Scholar 

  36. DR Stinson R Wei L Zhu (2000) ArticleTitleSome new bounds for cover-free families J Comb Theory A 90 224–234 Occurrence Handle0948.05055 Occurrence Handle1749434 Occurrence Handle10.1006/jcta.1999.3036

    Article  MATH  MathSciNet  Google Scholar 

  37. Wang H, Pieprzyk J Shared generation of pseudo-random function with cumulative maps. CT-RSA’03, LNCS 2612:281–294

  38. H Wang C Xing (2001) ArticleTitleExplicit constructions of perfect hash families from algebraic curves over finite fields J Comb Theory A 93 112–124 Occurrence Handle1015.11027 Occurrence Handle1807113 Occurrence Handle10.1006/jcta.2000.3068

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Science and Technology of China, Hefei, China

    Shoulun Long

  2. Department of Computing, Centre for Advanced Computing – Algorithms and Cryptography, Macquarie University, Sydney, 2109, NSW, Australia

    Josef Pieprzyk & Huaxiong Wang

  3. Department of Computer Science, City University of Hong Kong, Hong Kong, China

    Duncan S. Wong

Authors
  1. Shoulun Long
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Josef Pieprzyk
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Huaxiong Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Duncan S. Wong
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Huaxiong Wang.

Additional information

Communicated by P. Wild.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Long, S., Pieprzyk, J., Wang, H. et al. Generalised Cumulative Arrays in Secret Sharing. Des Codes Crypt 40, 191–209 (2006). https://doi.org/10.1007/s10623-006-0007-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-0007-5

Keywords