首页 > 最新文献

International Conference on the Theory and Application of Cryptographic Techniques最新文献

英文 中文
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model 量子随机Oracle模型中的非均匀性和量子通知
Pub Date : 2022-10-13 DOI: 10.48550/arXiv.2210.06693
Qipeng Liu
QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe non-uniform quantum algorithms with preprocessing power, which receives a piece of bounded classical or quantum advice. As non-uniform algorithms are largely believed to be the right model for attackers, starting from the work by Nayebi, Aaronson, Belovs, and Trevisan (QIC 2015), a line of works investigates non-uniform security in the random oracle model. Chung, Guo, Liu, and Qian (FOCS 2020) provide a framework and establish non-uniform security for many cryptographic applications. In this work, we continue the study on quantum advice in the QROM. We provide a new idea that generalizes the previous multi-instance framework, which we believe is more quantum-friendly and should be the quantum analogue of multi-instance games. To this end, we match the bounds with quantum advice to those with classical advice by Chung et al., showing quantum advice is almost as good/bad as classical advice for many natural security games in the QROM. Finally, we show that for some contrived games in the QROM, quantum advice can be exponentially better than classical advice for some parameter regimes. To our best knowledge, it provides some evidence of a general separation between quantum and classical advice relative to an unstructured oracle.
Boneh等人(Asiacrypt 2011)引入的QROM(量子随机oracle模型)捕获了所有通用算法。然而,它无法描述具有预处理能力的非均匀量子算法,它接收一条有界的经典或量子建议。由于非统一算法在很大程度上被认为是攻击者的正确模型,因此从Nayebi, Aaronson, Belovs和Trevisan (QIC 2015)的工作开始,一系列工作研究了随机oracle模型中的非统一安全性。Chung, Guo, Liu和Qian (FOCS 2020)为许多加密应用提供了一个框架并建立了非统一的安全性。在本工作中,我们继续对QROM中的量子建议进行研究。我们提供了一个新的思想,推广了以前的多实例框架,我们认为它是更量子友好的,应该是多实例博弈的量子模拟。为此,我们将量子建议的边界与Chung等人的经典建议的边界进行了匹配,结果表明,对于量子rom中的许多自然安全博弈,量子建议几乎与经典建议一样好/坏。最后,我们证明了对于QROM中的一些人为博弈,对于某些参数体系,量子通知可以指数地优于经典通知。据我们所知,它提供了一些证据,证明相对于非结构化的oracle,量子建议和经典建议之间存在普遍的分离。
{"title":"Non-uniformity and Quantum Advice in the Quantum Random Oracle Model","authors":"Qipeng Liu","doi":"10.48550/arXiv.2210.06693","DOIUrl":"https://doi.org/10.48550/arXiv.2210.06693","url":null,"abstract":"QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe non-uniform quantum algorithms with preprocessing power, which receives a piece of bounded classical or quantum advice. As non-uniform algorithms are largely believed to be the right model for attackers, starting from the work by Nayebi, Aaronson, Belovs, and Trevisan (QIC 2015), a line of works investigates non-uniform security in the random oracle model. Chung, Guo, Liu, and Qian (FOCS 2020) provide a framework and establish non-uniform security for many cryptographic applications. In this work, we continue the study on quantum advice in the QROM. We provide a new idea that generalizes the previous multi-instance framework, which we believe is more quantum-friendly and should be the quantum analogue of multi-instance games. To this end, we match the bounds with quantum advice to those with classical advice by Chung et al., showing quantum advice is almost as good/bad as classical advice for many natural security games in the QROM. Finally, we show that for some contrived games in the QROM, quantum advice can be exponentially better than classical advice for some parameter regimes. To our best knowledge, it provides some evidence of a general separation between quantum and classical advice relative to an unstructured oracle.","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124743008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Secure Software Leasing 安全软件租赁
Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-77886-6_17
P. Ananth, R. L. Placa
{"title":"Secure Software Leasing","authors":"P. Ananth, R. L. Placa","doi":"10.1007/978-3-030-77886-6_17","DOIUrl":"https://doi.org/10.1007/978-3-030-77886-6_17","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114370484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security 测度-倒带-测度:单向隐藏和CCA安全性的更紧量子随机Oracle模型证明
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45727-3_24
Veronika Kuchta, A. Sakzad, D. Stehlé, Ron Steinfeld, Shifeng Sun
{"title":"Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security","authors":"Veronika Kuchta, A. Sakzad, D. Stehlé, Ron Steinfeld, Shifeng Sun","doi":"10.1007/978-3-030-45727-3_24","DOIUrl":"https://doi.org/10.1007/978-3-030-45727-3_24","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128901860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 39
Non-interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions 弱假设下无配对群体的非交互零知识
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45727-3_15
Geoffroy Couteau, Shuichi Katsumata, B. Ursu
{"title":"Non-interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions","authors":"Geoffroy Couteau, Shuichi Katsumata, B. Ursu","doi":"10.1007/978-3-030-45727-3_15","DOIUrl":"https://doi.org/10.1007/978-3-030-45727-3_15","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121542875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Sigma Protocols for MQ, PKP and SIS, and Fishy Signature Schemes MQ、PKP和SIS的Sigma协议和Fishy签名方案
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45727-3_7
Ward Beullens
{"title":"Sigma Protocols for MQ, PKP and SIS, and Fishy Signature Schemes","authors":"Ward Beullens","doi":"10.1007/978-3-030-45727-3_7","DOIUrl":"https://doi.org/10.1007/978-3-030-45727-3_7","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134447797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory 具有多项式存储器的20.65n低权离散对数和子集和
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45727-3_4
Andre Esser, Alexander May
{"title":"Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory","authors":"Andre Esser, Alexander May","doi":"10.1007/978-3-030-45727-3_4","DOIUrl":"https://doi.org/10.1007/978-3-030-45727-3_4","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114439730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Key Recovery from Gram-Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices NTRU格上hash - sign签名中Gram-Schmidt范数泄漏的密钥恢复
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45727-3_2
Pierre-Alain Fouque, P. Kirchner, Mehdi Tibouchi, Alexandre Wallet, Yang Yu
{"title":"Key Recovery from Gram-Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices","authors":"Pierre-Alain Fouque, P. Kirchner, Mehdi Tibouchi, Alexandre Wallet, Yang Yu","doi":"10.1007/978-3-030-45727-3_2","DOIUrl":"https://doi.org/10.1007/978-3-030-45727-3_2","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132361419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Optimal Merging in Quantum k-xor and k-xor-sum Algorithms 量子k-xor和k-xor-sum算法的最优合并
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45724-2_11
M. Naya-Plasencia, A. Schrottenloher
{"title":"Optimal Merging in Quantum k-xor and k-xor-sum Algorithms","authors":"M. Naya-Plasencia, A. Schrottenloher","doi":"10.1007/978-3-030-45724-2_11","DOIUrl":"https://doi.org/10.1007/978-3-030-45724-2_11","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123936823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Low Error Efficient Computational Extractors in the CRS Model CRS模型中的低误差高效计算提取器
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45721-1_14
A. Garg, Y. Kalai, Dakshita Khurana
{"title":"Low Error Efficient Computational Extractors in the CRS Model","authors":"A. Garg, Y. Kalai, Dakshita Khurana","doi":"10.1007/978-3-030-45721-1_14","DOIUrl":"https://doi.org/10.1007/978-3-030-45721-1_14","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? 哪些语言有单向函数的四轮全黑盒零知识参数?
Pub Date : 2020-05-10 DOI: 10.1007/978-3-030-45727-3_20
Carmit Hazay, R. Pass, Muthuramakrishnan Venkitasubramaniam
{"title":"Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?","authors":"Carmit Hazay, R. Pass, Muthuramakrishnan Venkitasubramaniam","doi":"10.1007/978-3-030-45727-3_20","DOIUrl":"https://doi.org/10.1007/978-3-030-45727-3_20","url":null,"abstract":"","PeriodicalId":117521,"journal":{"name":"International Conference on the Theory and Application of Cryptographic Techniques","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130461953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
International Conference on the Theory and Application of Cryptographic Techniques
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1