TY - GEN
T1 - Bounded Simultaneous Messages
AU - Bogdanov, Andrej
AU - Dinesh, Krishnamoorthy
AU - Filmus, Yuval
AU - Ishai, Yuval
AU - Kaplan, Avi
AU - Sekar, Sruthi
N1 - Publisher Copyright:
© 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
PY - 2023/12
Y1 - 2023/12
N2 - We consider the following question of bounded simultaneous messages (BSM) protocols: Can computationally unbounded Alice and Bob evaluate a function f(x, y) of their inputs by sending polynomial-size messages to a computationally bounded Carol? The special case where f is the mod-2 inner-product function and Carol is bounded to AC0 has been studied in previous works. The general question can be broadly motivated by applications in which distributed computation is more costly than local computation. In this work, we initiate a more systematic study of the BSM model, with different functions f and computational bounds on Carol. In particular, we give evidence against the existence of BSM protocols with polynomial-size Carol for naturally distributed variants of NP-complete languages.
AB - We consider the following question of bounded simultaneous messages (BSM) protocols: Can computationally unbounded Alice and Bob evaluate a function f(x, y) of their inputs by sending polynomial-size messages to a computationally bounded Carol? The special case where f is the mod-2 inner-product function and Carol is bounded to AC0 has been studied in previous works. The general question can be broadly motivated by applications in which distributed computation is more costly than local computation. In this work, we initiate a more systematic study of the BSM model, with different functions f and computational bounds on Carol. In particular, we give evidence against the existence of BSM protocols with polynomial-size Carol for naturally distributed variants of NP-complete languages.
KW - Algebraic degree
KW - Instance Hiding
KW - Lower Bounds
KW - Preprocessing
KW - Simultaneous Messages
UR - http://www.scopus.com/inward/record.url?scp=85180780910&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.FSTTCS.2023.23
DO - 10.4230/LIPIcs.FSTTCS.2023.23
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85180780910
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023
A2 - Bouyer, Patricia
A2 - Srinivasan, Srikanth
A2 - Srinivasan, Srikanth
T2 - 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023
Y2 - 18 December 2023 through 20 December 2023
ER -