PRIVATE VS COMMON RANDOM BITS IN COMMUNICATION COMPLEXITY

被引：173
|
作者：
NEWMAN, I
机构：
[1] Computer Science Department, Hebrew University, Jerusalem
来源：
INFORMATION PROCESSING LETTERS | 1991年 / 39卷 / 02期
关键词：
THEORY OF COMPUTATION; COMMUNICATION COMPLEXITY; RANDOMNESS;
D O I：
10.1016/0020-0190(91)90157-D
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the two model, are essentially equal.
引用
收藏
页码：67 / 71
页数：5
相关论文
共 50 条
  • [1] On the number of random bits in totally private computation
    Blundo, C
    DeSantis, A
    Persiano, G
    Vaccaro, U
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1995, 944 : 171 - 182
  • [2] Complexity of Network Design for Private Communication and the P-vs-NP Question
    Rass, Stefan
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2014, 5 (02) : 148 - 157
  • [3] Learning Complexity vs Communication Complexity
    Linial, Nati
    Shraibman, Adi
    COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (1-2): : 227 - 245
  • [4] Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity
    Fischer, Orr
    Oshman, Rotem
    Zwick, Uri
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2016, 2016, 9988 : 60 - 74
  • [5] Public vs. private randomness in simultaneous multi-party communication complexity
    Fischer, Orr
    Oshman, Rotem
    Zwick, Uri
    THEORETICAL COMPUTER SCIENCE, 2020, 810 : 72 - 81
  • [6] On Extracting Common Random Bits From Correlated Sources
    Bogdanov, Andrej
    Mossel, Elchanan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (10) : 6351 - 6355
  • [7] ON RANK VS COMMUNICATION COMPLEXITY
    NISAN, N
    WIGDERSON, A
    COMBINATORICA, 1995, 15 (04) : 557 - 565
  • [8] Learning complexity vs. communication complexity
    Linial, Nati
    Shraibman, Adi
    TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 53 - 63
  • [9] Reconstructing RSA Private Keys from Random Key Bits
    Heninger, Nadia
    Shacham, Hovav
    ADVANCES IN CRYPTOLOGY - CRYPTO 2009, 2009, 5677 : 1 - +
  • [10] The Communication Complexity of Private Simultaneous Messages, Revisited
    Applebaum, Benny
    Holenstein, Thomas
    Mishra, Manoj
    Shayevitz, Ofer
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II, 2018, 10821 : 261 - 286
12345