GROG 发表于 2025-3-28 15:14:35
http://reply.papertrans.cn/15/1476/147564/147564_41.png土坯 发表于 2025-3-28 22:11:23
http://reply.papertrans.cn/15/1476/147564/147564_42.pngPACT 发表于 2025-3-29 00:07:36
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/147564.jpg仪式 发表于 2025-3-29 03:22:44
http://reply.papertrans.cn/15/1476/147564/147564_44.pngmunicipality 发表于 2025-3-29 07:49:14
http://reply.papertrans.cn/15/1476/147564/147564_45.pngLacunar-Stroke 发表于 2025-3-29 13:05:21
http://reply.papertrans.cn/15/1476/147564/147564_46.png绿州 发表于 2025-3-29 16:18:03
http://reply.papertrans.cn/15/1476/147564/147564_47.png补角 发表于 2025-3-29 20:15:31
Mario F. Rubin,Raymond R. Townsendomplexity and efficiency of both the verifier and the prover. This improves over currently known transformations, which either rely on some computational assumptions or introduce significant computational overhead. Our main conceptual contribution is the introduction of instance-dependent SZK proofs