Paper 2024/1448
Randomness in Private Sequential Stateless Protocols
Abstract
A significant body of work in information-theoretic cryptography has been devoted to the fundamental problem of understanding the power of randomness in private computation. This has included both in-depth study of the randomness complexity of specific functions (e.g., Couteau and Ros ́en, ASIACRYPT 2022, gives an upper bound of 6 for n-party
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in ASIACRYPT 2024
- Contact author(s)
-
265harikrishnan @ gmail com
varunnkv @ gmail com
mp @ cse iitb ac in
vinodmp @ tifr res in - History
- 2024-09-27: revised
- 2024-09-17: received
- See all versions
- Short URL
- https://ia.cr/2024/1448
- License
-
CC BY-SA
BibTeX
@misc{cryptoeprint:2024/1448, author = {Hari Krishnan P. Anilkumar and Varun Narayanan and Manoj Prabhakaran and Vinod M. Prabhakaran}, title = {Randomness in Private Sequential Stateless Protocols}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1448}, year = {2024}, url = {https://eprint.iacr.org/2024/1448} }