Document Open Access Logo

Randomness Recoverable Secret Sharing Schemes

Authors Mohammad Hajiabadi, Shahram Khazaei , Behzad Vahdani

PDF
Thumbnail PDF

File

LIPIcs.ITC.2023.12.pdf
  • Filesize: 0.9 MB
  • 25 pages

Document Identifiers

Author Details

Mohammad Hajiabadi
  • Cheriton School of Computer Science, University of Waterloo, Canada
Shahram Khazaei
  • Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran
Behzad Vahdani
  • Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

Acknowledgements

We would like to thank Sorush Bahariyan for bringing Fact 1 to our attention and Motahareh Gharahi for fruitful discussions on the proof of Theorem 20.

Cite As Get BibTex

Mohammad Hajiabadi, Shahram Khazaei, and Behzad Vahdani. Randomness Recoverable Secret Sharing Schemes. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 12:1-12:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.ITC.2023.12

Abstract

It is well-known that randomness is essential for secure cryptography. The randomness used in cryptographic primitives is not necessarily recoverable even by the party who can, e.g., decrypt or recover the underlying secret/message. Several cryptographic primitives that support randomness recovery have turned out useful in various applications. In this paper, we study randomness recoverable secret sharing schemes (RR-SSS), in both information-theoretic and computational settings and provide two results. First, we show that while every access structure admits a perfect RR-SSS, there are very simple access structures (e.g., in monotone AC⁰) that do not admit efficient perfect (or even statistical) RR-SSS. Second, we show that the existence of efficient computational RR-SSS for certain access structures in monotone AC⁰ implies the existence of one-way functions. This stands in sharp contrast to (non-RR) SSS schemes for which no such results are known. 
RR-SSS plays a key role in making advanced attributed-based encryption schemes randomness recoverable, which in turn have applications in the context of designated-verifier non-interactive zero knowledge.

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
  • Security and privacy → Mathematical foundations of cryptography
Keywords
  • Secret sharing
  • Randomness recovery

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Navid Alamati and Sikhar Patranabis. Cryptographic primitives with hinting property. In Shweta Agrawal and Dongdai Lin, editors, Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part I, volume 13791 of Lecture Notes in Computer Science, pages 33-62. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-22963-3_2.
  2. Benny Applebaum and Barak Arkis. On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate. ACM Trans. Comput. Theory, 12(4):24:1-24:21, 2020. URL: https://doi.org/10.1145/3417756.
  3. Amos Beimel. Secret-sharing schemes: A survey. In Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings, pages 11-46, 2011. URL: https://doi.org/10.1007/978-3-642-20901-7_2.
  4. Amos Beimel and Yuval Ishai. On the power of nonlinear secret-sharing. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pages 188-202, 2001. URL: https://doi.org/10.1109/CCC.2001.933886.
  5. Mihir Bellare and Phillip Rogaway. Optimal asymmetric encryption. In Alfredo De Santis, editor, Advances in Cryptology - EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings, volume 950 of Lecture Notes in Computer Science, pages 92-111. Springer, 1994. URL: https://doi.org/10.1007/BFb0053428.
  6. Josh Cohen Benaloh and Jerry Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings, pages 27-35, 1988. URL: https://doi.org/10.1007/0-387-34799-2_3.
  7. George Robert Blakley. Safeguarding cryptographic keys. Proceedings of the 1979 AFIPS National Computer Conference, 48:313-317, 1979. Google Scholar
  8. Dan Boneh. Simplified OAEP for the RSA and rabin functions. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings, volume 2139 of Lecture Notes in Computer Science, pages 275-291. Springer, 2001. URL: https://doi.org/10.1007/3-540-44647-8_17.
  9. Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, and Ugo Vaccaro. On the size of shares for secret sharing schemes. J. Cryptology, 6(3):157-167, 1993. URL: https://doi.org/10.1007/BF00198463.
  10. László Csirmaz. The size of a share must be large. J. Cryptology, 10(4):223-231, 1997. URL: https://doi.org/10.1007/s001459900029.
  11. László Csirmaz. Secret sharing and duality. J. Math. Cryptol., 15(1):157-173, 2020. URL: https://doi.org/10.1515/jmc-2019-0045.
  12. Abbas El Gamal and Young-Han Kim. Network Information Theory. Cambridge University Press, 2011. URL: https://doi.org/10.1017/CBO9781139030687.
  13. Sanjam Garg, Mohammad Hajiabadi, Giulio Malavolta, and Rafail Ostrovsky. How to build a trapdoor function from an encryption scheme. In Mehdi Tibouchi and Huaxiong Wang, editors, Advances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021, Proceedings, Part III, volume 13092 of Lecture Notes in Computer Science, pages 220-249. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-92078-4_8.
  14. Susan Hohenberger, Venkata Koppula, and Brent Waters. Chosen ciphertext security from injective trapdoor functions. In Daniele Micciancio and Thomas Ristenpart, editors, Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part I, volume 12170 of Lecture Notes in Computer Science, pages 836-866. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-56784-2_28.
  15. Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions (extended abstracts). In David S. Johnson, editor, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA, pages 12-24. ACM, 1989. URL: https://doi.org/10.1145/73007.73009.
  16. Russell Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography. In 30th Annual Symposium on Foundations of Computer Science, pages 230-235, 1989. URL: https://doi.org/10.1109/SFCS.1989.63483.
  17. Mitsuru Ito, Akira Saio, and Takao Nishizeki. Multiple assignment scheme for sharing secret. J. Cryptol., 6(1):15-20, 1993. URL: https://doi.org/10.1007/BF02620229.
  18. Mitsuru Ito, Akira Saito, and Takao Nishizeki. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72(9):56-64, 1989. Google Scholar
  19. Amir Jafari and Shahram Khazaei. Partial secret sharing schemes. IACR Cryptol. ePrint Arch., 2020:448, 2020. URL: https://eprint.iacr.org/2020/448.
  20. Tarik Kaced. Almost-perfect secret sharing. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, pages 1603-1607, 2011. URL: https://doi.org/10.1109/ISIT.2011.6033816.
  21. Tarik Kaced. Information inequalities are not closed under polymatroid duality. IEEE Trans. Information Theory, 64(6):4379-4381, 2018. URL: https://doi.org/10.1109/TIT.2018.2823328.
  22. Mauricio Karchmer and Avi Wigderson. On span programs. In Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pages 102-111, 1993. URL: https://doi.org/10.1109/SCT.1993.336536.
  23. Ehud D. Karnin, J. W. Greene, and Martin E. Hellman. On secret sharing systems. IEEE Trans. Information Theory, 29(1):35-41, 1983. URL: https://doi.org/10.1109/TIT.1983.1056621.
  24. Shahram Khazaei, Tal Moran, and Douglas Wikström. A mix-net from any CCA2 secure cryptosystem. In Xiaoyun Wang and Kazue Sako, editors, Advances in Cryptology - ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings, volume 7658 of Lecture Notes in Computer Science, pages 607-625. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-34961-4_37.
  25. Fuyuki Kitagawa, Takahiro Matsuda, and Keisuke Tanaka. CCA security and trapdoor functions via key-dependent-message security. J. Cryptol., 35(2):9, 2022. URL: https://doi.org/10.1007/s00145-022-09420-8.
  26. Ilan Komargodski, Moni Naor, and Eylon Yogev. Secret-sharing for NP. J. Cryptol., 30(2):444-469, 2017. URL: https://doi.org/10.1007/s00145-015-9226-0.
  27. Venkata Koppula and Brent Waters. Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption. In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II, volume 11693 of Lecture Notes in Computer Science, pages 671-700. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-26951-7_23.
  28. Chung Ki Li and Duncan S. Wong. Signcryption from randomness recoverable public key encryption. Inf. Sci., 180(4):549-559, 2010. URL: https://doi.org/10.1016/j.ins.2009.10.015.
  29. Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, and David J. Wu. New constructions of reusable designated-verifier nizks. In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III, volume 11694 of Lecture Notes in Computer Science, pages 670-700. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-26954-8_22.
  30. Silvio Micali. Simple and fast optimistic protocols for fair electronic exchange. In Elizabeth Borowsky and Sergio Rajsbaum, editors, Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, July 13-16, 2003, pages 12-19. ACM, 2003. URL: https://doi.org/10.1145/872035.872038.
  31. John W Moon and Leo Moser. On cliques in graphs. Israel journal of Mathematics, 3(1):23-28, 1965. Google Scholar
  32. Duong Hieu Phan and David Pointcheval. Chosen-ciphertext security without redundancy. In Chi-Sung Laih, editor, Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings, volume 2894 of Lecture Notes in Computer Science, pages 1-18. Springer, 2003. URL: https://doi.org/10.1007/978-3-540-40061-5_1.
  33. Phillip Rogaway and Mihir Bellare. Robust computational secret sharing and a unified account of classical secret-sharing goals. In Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, October 28-31, 2007, pages 172-184, 2007. URL: https://doi.org/10.1145/1315245.1315268.
  34. Adi Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979. URL: https://doi.org/10.1145/359168.359176.
  35. Victor Shoup. OAEP reconsidered. J. Cryptol., 15(4):223-249, 2002. URL: https://doi.org/10.1007/s00145-002-0133-9.
  36. Vinod Vaikuntanathan, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, and Kwangjo Kim. On the power of computational secret sharing. In Thomas Johansson and Subhamoy Maitra, editors, Progress in Cryptology - INDOCRYPT 2003, 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings, volume 2904 of Lecture Notes in Computer Science, pages 162-176. Springer, 2003. URL: https://doi.org/10.1007/978-3-540-24582-7_12.
  37. Andrew Chi-Chih Yao. Theory and applications of trapdoor functions (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, pages 80-91. IEEE Computer Society, 1982. URL: https://doi.org/10.1109/SFCS.1982.45.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact