Pub Date : 2023-11-01DOI: 10.1007/s00145-023-09483-1
Nir Drucker, Guy Moshkowich, Tomer Pelleg, Hayim Shaul
{"title":"BLEACH: Cleaning Errors in Discrete Computations Over CKKS","authors":"Nir Drucker, Guy Moshkowich, Tomer Pelleg, Hayim Shaul","doi":"10.1007/s00145-023-09483-1","DOIUrl":"https://doi.org/10.1007/s00145-023-09483-1","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":"45 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135271316","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}
Pub Date : 2023-10-27DOI: 10.1007/s00145-023-09484-0
E. Boyle, R. Cohen, A. Goel
{"title":"Breaking the $$O(sqrt{n})$$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party","authors":"E. Boyle, R. Cohen, A. Goel","doi":"10.1007/s00145-023-09484-0","DOIUrl":"https://doi.org/10.1007/s00145-023-09484-0","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":"4 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136234344","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}
Pub Date : 2023-10-18DOI: 10.1007/s00145-023-09482-2
Yuval Ishai, Alexis Korb, Paul Lou, Amit Sahai
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}$$ ChB , while at the same time hiding m from Eve who receives c over another noisy channel $$textsf{ChE}$$ ChE . Wiretap coding is clearly impossible when $$textsf{ChB}$$ ChB is a degraded version of $$textsf{ChE}$$ ChE , in the sense that the output of $$textsf{ChB}$$ ChB can be simulated using only the output of $$textsf{ChE}$$ ChE . 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})$$ (ChB,ChE) 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}$$ ChB is not a degraded version of $$textsf{ChE}$$ ChE . 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}$$ ChB and not on $$textsf{ChE}$$ ChE .
一种窃听编码方案(Wyner in Bell system Tech J 54(8): 1355-1387, 1975)使Alice能够通过噪声信道$$textsf{ChB}$$ ChB发送编码c，从而可靠地将消息m传递给诚实的Bob，同时将m隐藏给Eve, Eve通过另一个噪声信道$$textsf{ChE}$$ ChE接收到c。当$$textsf{ChB}$$ ChB是$$textsf{ChE}$$ ChE的降级版本时，窃听编码显然是不可能的，因为只能使用$$textsf{ChE}$$ ChE的输出来模拟$$textsf{ChB}$$ ChB的输出。Csiszár和Korner的经典著作(IEEE Trans Inf Theory 24(3):339 - 348,1978)表明，相反的情况并不成立。这源于他们对信道对$$(textsf{ChB},textsf{ChE})$$ (ChB, ChE)的完整描述，这些信道对使信息论窃听编码成为可能。在这项工作中，我们表明，事实上，在考虑计算安全性时，相反的情况确实成立;也就是说，当且仅当$$textsf{ChB}$$ ChB不是$$textsf{ChE}$$ ChE的降级版本时，针对计算受限的Eve进行窃听编码是可能的。我们的构造假设存在特定类别的“回避”函数的虚拟黑箱混淆，这些函数概括了模糊点函数，并且可以使用不可区分混淆进行启发式实例化。最后，我们的解决方案具有吸引人的通用性，因为Alice的算法仅依赖于$$textsf{ChB}$$ ChB而不依赖于$$textsf{ChE}$$ ChE。
{"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}
Pub Date : 2023-10-01DOI: 10.1007/s00145-023-09481-3
Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez
{"title":"Rinocchio: SNARKs for Ring Arithmetic","authors":"Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez","doi":"10.1007/s00145-023-09481-3","DOIUrl":"https://doi.org/10.1007/s00145-023-09481-3","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136119563","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}
Pub Date : 2023-09-26DOI: 10.1007/s00145-023-09480-4
Lior Rotem, Gil Segev
{"title":"Non-malleable Vector Commitments via Local Equivocability","authors":"Lior Rotem, Gil Segev","doi":"10.1007/s00145-023-09480-4","DOIUrl":"https://doi.org/10.1007/s00145-023-09480-4","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134903228","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}
Pub Date : 2023-09-12DOI: 10.1007/s00145-023-09473-3
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
{"title":"Topology-Hiding Communication from Minimal Assumptions","authors":"Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran","doi":"10.1007/s00145-023-09473-3","DOIUrl":"https://doi.org/10.1007/s00145-023-09473-3","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135826809","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}
Pub Date : 2023-08-23DOI: 10.1007/s00145-023-09476-0
Valence Cristiani, Maxime Lecomte, P. Maurine
{"title":"Revisiting Mutual Information Analysis: Multidimensionality, Neural Estimation and Optimality Proofs","authors":"Valence Cristiani, Maxime Lecomte, P. Maurine","doi":"10.1007/s00145-023-09476-0","DOIUrl":"https://doi.org/10.1007/s00145-023-09476-0","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":" ","pages":""},"PeriodicalIF":3.0,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48028845","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}
Pub Date : 2023-08-08DOI: 10.1007/s00145-023-09478-y
T. Attema, S. Fehr, Michael Klooß
{"title":"Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version)","authors":"T. Attema, S. Fehr, Michael Klooß","doi":"10.1007/s00145-023-09478-y","DOIUrl":"https://doi.org/10.1007/s00145-023-09478-y","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":" ","pages":""},"PeriodicalIF":3.0,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44773710","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}
Pub Date : 2023-08-03DOI: 10.1007/s00145-023-09475-1
A. Preprint, Marten van Dijk, Chenglu Jin
{"title":"A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model","authors":"A. Preprint, Marten van Dijk, Chenglu Jin","doi":"10.1007/s00145-023-09475-1","DOIUrl":"https://doi.org/10.1007/s00145-023-09475-1","url":null,"abstract":"","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":" ","pages":""},"PeriodicalIF":3.0,"publicationDate":"2023-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43356498","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：