Journal of Cryptology最新文献_第4页

BLEACH: Cleaning Errors in Discrete Computations Over CKKS 在CKKS上离散计算的清理错误

3区计算机科学

Journal of Cryptology Pub Date : 2023-11-01 DOI: 10.1007/s00145-023-09483-1

Nir Drucker, Guy Moshkowich, Tomer Pelleg, Hayim Shaul

引用次数: 6

Breaking the $$O(sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party 打破$$O(sqrt{n})$$ -Bit障碍:与Polylog Bits Per Party的拜占庭协议

3区计算机科学

Journal of Cryptology Pub Date : 2023-10-27 DOI: 10.1007/s00145-023-09484-0

E. Boyle, R. Cohen, A. Goel

引用次数: 0

Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation 超越Csiszár-Körner界限:通过混淆实现最佳窃听编码

3区计算机科学

Journal of Cryptology Pub Date : 2023-10-18 DOI: 10.1007/s00145-023-09482-2

Yuval Ishai, Alexis Korb, Paul Lou, Amit Sahai

{"title":"Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation","authors":"Yuval Ishai, Alexis Korb, Paul Lou, Amit Sahai","doi":"10.1007/s00145-023-09482-2","DOIUrl":"https://doi.org/10.1007/s00145-023-09482-2","url":null,"abstract":"Abstract A wiretap coding scheme (Wyner in Bell Syst Tech J 54(8):1355–1387, 1975) enables Alice to reliably communicate a message m to an honest Bob by sending an encoding c over a noisy channel $$textsf{ChB}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChB</mml:mi> </mml:math> , while at the same time hiding m from Eve who receives c over another noisy channel $$textsf{ChE}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChE</mml:mi> </mml:math> . Wiretap coding is clearly impossible when $$textsf{ChB}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChB</mml:mi> </mml:math> is a degraded version of $$textsf{ChE}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChE</mml:mi> </mml:math> , in the sense that the output of $$textsf{ChB}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChB</mml:mi> </mml:math> can be simulated using only the output of $$textsf{ChE}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChE</mml:mi> </mml:math> . A classic work of Csiszár and Korner (IEEE Trans Inf Theory 24(3):339–348, 1978) shows that the converse does not hold. This follows from their full characterization of the channel pairs $$(textsf{ChB},textsf{ChE})$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>ChB</mml:mi> <mml:mo>,</mml:mo> <mml:mi>ChE</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> that enable information-theoretic wiretap coding. In this work, we show that in fact the converse does hold when considering computational security ; that is, wiretap coding against a computationally bounded Eve is possible if and only if $$textsf{ChB}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChB</mml:mi> </mml:math> is not a degraded version of $$textsf{ChE}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChE</mml:mi> </mml:math> . Our construction assumes the existence of virtual black-box obfuscation of specific classes of “evasive” functions that generalize fuzzy point functions and can be heuristically instantiated using indistinguishability obfuscation. Finally, our solution has the appealing feature of being universal in the sense that Alice’s algorithm depends only on $$textsf{ChB}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChB</mml:mi> </mml:math> and not on $$textsf{ChE}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ChE</mml:mi> </mml:math> .","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135825274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Rinocchio: SNARKs for Ring Arithmetic 瑞诺乔:环算的陷阱

3区计算机科学

Journal of Cryptology Pub Date : 2023-10-01 DOI: 10.1007/s00145-023-09481-3

Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez

引用次数: 26

Non-malleable Vector Commitments via Local Equivocability 基于局部模糊性的不可延展性向量承诺

3区计算机科学

Journal of Cryptology Pub Date : 2023-09-26 DOI: 10.1007/s00145-023-09480-4

Lior Rotem, Gil Segev

引用次数: 1

Topology-Hiding Communication from Minimal Assumptions 最小假设下的拓扑隐藏通信