EFFICIENT IDENTIFICATION SCHEMES USING 2 PROVER INTERACTIVE PROOFS

被引:0
|
作者
BENOR, M [1 ]
GOLDWASSER, S [1 ]
KILIAN, J [1 ]
WIGDERSON, A [1 ]
机构
[1] MIT, CAMBRIDGE, MA 02139 USA
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:498 / 506
页数:9
相关论文
共 50 条
  • [1] On interactive proofs with a laconic prover
    Goldreich, O
    Vadhan, S
    Wigderson, A
    [J]. AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 334 - 345
  • [2] On interactive proofs with a laconic prover
    Oded Goldreich
    Salil Vadhan
    Avi Wigderson
    [J]. computational complexity, 2002, 11 : 1 - 53
  • [3] Interactive proofs with a laconic prover
    Goldreich, O
    Vadhan, S
    Wigderson, A
    [J]. COMPUTATIONAL COMPLEXITY, 2002, 11 (1-2) : 1 - 53
  • [4] Distributed-Prover Interactive Proofs
    Das, Sourav
    Fernando, Rex
    Komargodski, Ilan
    Shi, Elaine
    Soni, Pratik
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2023, PT I, 2023, 14369 : 91 - 120
  • [5] Using entanglement in quantum multi-prover interactive proofs
    Kempe, Julia
    Kobayashi, Hirotada
    Matsumoto, Keiji
    Vidick, Thomas
    [J]. TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 211 - +
  • [6] Using Entanglement in Quantum Multi-Prover Interactive Proofs
    Julia Kempe
    Hirotada Kobayashi
    Keiji Matsumoto
    Thomas Vidick
    [J]. computational complexity, 2009, 18 : 273 - 307
  • [7] USING ENTANGLEMENT IN QUANTUM MULTI-PROVER INTERACTIVE PROOFS
    Kempe, Julia
    Kobayashi, Hirotada
    Matsumoto, Keiji
    Vidick, Thomas
    [J]. COMPUTATIONAL COMPLEXITY, 2009, 18 (02) : 273 - 307
  • [8] Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time
    Zhang, Jiaheng
    Liu, Tianyi
    Wang, Weijie
    Zhang, Yinuo
    Song, Dawn
    Xie, Xiang
    Zhang, Yupeng
    [J]. CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, : 159 - 177
  • [9] Quantum Multi Prover Interactive Proofs with Communicating Provers
    Ben Or, Michael
    Hassidim, Avinatan
    Pilpel, Haran
    [J]. PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 467 - 476
  • [10] Compression of Quantum Multi-prover Interactive Proofs
    Ji, Zhengfeng
    [J]. STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 289 - 302