Document Open Access Logo

Towards Characterizing Secure Samplability

Authors Hari Krishnan P. Anilkumar , Keval Jain , Manoj Prabhakaran, Vinod M. Prabhakaran

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITC.2026.6.pdf
  • Filesize: 0.84 MB
  • 21 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
Keywords
  • secure sampling
  • information-theoretic MPC

Metrics

Abstract

This work deals with the fundamental problem of characterizing which multiparty distributions can be securely sampled with information-theoretic security against passive corruption, when there is no setup or honest-majority. We focus on the case of 4-party distributions with boolean outputs for each party. We show that such a distribution is securely samplable if and only if every 2-party distribution derived from it by partitioning the parties into two sets is securely samplable. This extends a similar characterization previously known for 3-party distributions.

Cite As Get BibTex

Hari Krishnan P. Anilkumar, Hari Krishnan P. Anilkumar, Keval Jain, Keval Jain, Manoj Prabhakaran, Manoj Prabhakaran, Vinod M. Prabhakaran, and Vinod M. Prabhakaran. Towards Characterizing Secure Samplability. In 7th Conference on Information-Theoretic Cryptography (ITC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 385, pp. 6:1-6:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ITC.2026.6

Author Details

Hari Krishnan P. Anilkumar
  • TIFR, Mumbai, India
Keval Jain
  • IIIT Hyderabad, India
Manoj Prabhakaran
  • IIT Bombay, Mumbai, India
Vinod M. Prabhakaran
  • TIFR, Mumbai, India

Funding

  • Anilkumar, Hari Krishnan P.: supported by DAE, Govt. of India, under RTI4014.
  • Jain, Keval: supported by IIT Bombay Trust Lab internship and by STCS, TIFR.
  • Prabhakaran, Manoj: supported in part by IIT Bombay Trust Lab.
  • Prabhakaran, Vinod M.: supported by DAE, Govt. of India, under RTI4014 and by ANRF through ANRF/ARGM/2025/000821/TS.

References

  1. Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, and Hai H. Nguyen. Geometry of secure two-party computation. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 1035-1044. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00101.
  2. Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, and Hai H. Nguyen. Solving linear inequalities over the space of convex sets & its applications to cryptography and hydrodynamics. In 66th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2025, Sydney, Australia, December 14-17, 2025, pages 2369-2380. IEEE, 2025. URL: https://doi.org/10.1109/FOCS63196.2025.00124.
  3. Donald Beaver. Foundations of secure interactive computing. In Advances in Cryptology - CRYPTO '91, pages 377-391. Springer, 1991. URL: https://doi.org/10.1007/3-540-46766-1_31.
  4. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pages 1-10. ACM, 1988. Google Scholar
  5. David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pages 11-19. ACM, 1988. Google Scholar
  6. Benny Chor and Yuval Ishai. On privacy and partition arguments. Inf. Comput., 167(1):2-9, 2001. URL: https://doi.org/10.1006/inco.2000.3013.
  7. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229. ACM, 1987. URL: https://doi.org/10.1145/28395.28420.
  8. Joe Kilian. Founding cryptography on oblivious transfer. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), pages 20-31. ACM, 1988. URL: https://doi.org/10.1145/62212.62215.
  9. Joe Kilian. More general completeness theorems for secure two-party computation. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 316-324. ACM, 2000. URL: https://doi.org/10.1145/335305.335342.
  10. Eyal Kushilevitz. Privacy and communication complexity. SIAM Journal on Discrete Mathematics, 5(2):273-284, 1992. Originally presented at FOCS 1989. URL: https://doi.org/10.1137/0405021.
  11. Hemanta K. Maji, Manoj Prabhakaran, and Mike Rosulek. Complexity of multi-party computation functionalities. In Manoj Prabhakaran and Amit Sahai, editors, Secure Multi-Party Computation, volume 10 of Cryptology and Information Security Series, pages 249-283. IOS Press, 2013. URL: https://doi.org/10.3233/978-1-61499-169-4-249.
  12. Manoj Prabhakaran and Vinod M. Prabhakaran. On secure multiparty sampling for more than two parties. In 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012, pages 99-103. IEEE, 2012. URL: https://doi.org/10.1109/ITW.2012.6404773.
  13. Vinod M. Prabhakaran and Manoj M. Prabhakaran. Assisted common information with an application to secure two-party sampling. IEEE Transactions on Information Theory, 60(6):3413-3434, 2014. URL: https://doi.org/10.1109/TIT.2014.2316011.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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