Zobrazeno 1 - 10
of 113
pro vyhledávání: '"Prabhakaran, Manoj"'
Autor:
Anilkumar, Hari Krishnan P., Rajesh, Aayush, Narayanan, Varun, Prabhakaran, Manoj M., Prabhakaran, Vinod M.
We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of shares reveal
Externí odkaz:
http://arxiv.org/abs/2304.14934
Autor:
Karayadi H. Fausia, Bijoy Nharangatt, Ramachandran Nair Vinayakan, Analiparambil R. Ramesh, Vijayan Santhi, Kuppathil R. Dhandapani, Thathamkulam Prabhakaran Manoj, Raghu Chatanathodi, Deepthi Jose, Kulangara Sandeep
Publikováno v:
ACS Omega, Vol 9, Iss 7, Pp 8417-8424 (2024)
Externí odkaz:
https://doaj.org/article/b2f292c0f12d409a9ca1d718beaf372b
Differential Privacy (DP) has become a gold standard in privacy-preserving data analysis. While it provides one of the most rigorous notions of privacy, there are many settings where its applicability is limited. Our main contribution is in augmentin
Externí odkaz:
http://arxiv.org/abs/2110.09580
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In secure multiparty computation (MPC), mutually distrusting users collaborate to compute a function of their private data without revealing any additional information about their data to other users. While it is known that information theoretically
Externí odkaz:
http://arxiv.org/abs/1512.07735
We introduce a new information-theoretic complexity measure $IC_\infty$ for 2-party functions which is a lower-bound on communication complexity, and has the two leading lower-bounds on communication complexity as its natural relaxations: (external)
Externí odkaz:
http://arxiv.org/abs/1511.07949
Secure Multi-Party Computation (MPC) is one of the most powerful tools developed by modern cryptography: it facilitates collaboration among mutually distrusting parties by implementing a virtual trusted party. Despite the remarkable potential of such
Autor:
Prabhakaran, Manoj, Selvi, Moorthy Karthika, Vijayaraj, Panneerselvam, Shetty, Nandini Prasad, Sreerama, Y. N.
Publikováno v:
Journal of Food Measurement & Characterization; Jun2024, Vol. 18 Issue 6, p4177-4191, 15p
The main contribution of this work is to relate information complexity to "tension" [Prabhakaran and Prabhakaran, 2014] - an information-theoretic quantity defined with no reference to protocols - and to illustrate that it allows deriving strong lowe
Externí odkaz:
http://arxiv.org/abs/1408.6285