发布求助
文献互助 智能选刊 最新文献

Annual International Cryptology Conference最新文献

筛选
英文 中文
Distinguisher-Dependent Simulation in Two Rounds and its Applications 基于区分符的两轮仿真及其应用
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63715-0_6
Abhishek Jain, Y. Kalai, Dakshita Khurana, R. Rothblum
{"title":"Distinguisher-Dependent Simulation in Two Rounds and its Applications","authors":"Abhishek Jain, Y. Kalai, Dakshita Khurana, R. Rothblum","doi":"10.1007/978-3-319-63715-0_6","DOIUrl":"https://doi.org/10.1007/978-3-319-63715-0_6","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123805141","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}
引用次数: 49
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient 具有非理想密钥调度的迭代偶曼苏尔密码的不可微性:五轮是充分必要的
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63697-9_18
Yuanxi Dai, Y. Seurin, J. Steinberger, Aishwarya Thiruvengadam
{"title":"Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient","authors":"Yuanxi Dai, Y. Seurin, J. Steinberger, Aishwarya Thiruvengadam","doi":"10.1007/978-3-319-63697-9_18","DOIUrl":"https://doi.org/10.1007/978-3-319-63697-9_18","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127882018","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}
引用次数: 20
Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization 图灵机的不可区分混淆:常数开销和摊销
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63715-0_9
P. Ananth, Abhishek Jain, A. Sahai
{"title":"Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization","authors":"P. Ananth, Abhishek Jain, A. Sahai","doi":"10.1007/978-3-319-63715-0_9","DOIUrl":"https://doi.org/10.1007/978-3-319-63715-0_9","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131918765","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}
引用次数: 13
Private Multiplication over Finite Fields 有限域上的私有乘法
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63697-9_14
Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, E. Prouff, Adrian Thillard, Damien Vergnaud
{"title":"Private Multiplication over Finite Fields","authors":"Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, E. Prouff, Adrian Thillard, Damien Vergnaud","doi":"10.1007/978-3-319-63697-9_14","DOIUrl":"https://doi.org/10.1007/978-3-319-63697-9_14","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125736588","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
PRF-ODH: Relations, Instantiations, and Impossibility Results PRF-ODH:关系、实例化和不可能结果
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63697-9_22
Jacqueline Brendel, M. Fischlin, Felix Günther, Christian Janson
{"title":"PRF-ODH: Relations, Instantiations, and Impossibility Results","authors":"Jacqueline Brendel, M. Fischlin, Felix Günther, Christian Janson","doi":"10.1007/978-3-319-63697-9_22","DOIUrl":"https://doi.org/10.1007/978-3-319-63697-9_22","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"348 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116496303","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}
引用次数: 43
The Price of Low Communication in Secure Multi-party Computation 安全多方计算中低通信的代价
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63688-7_14
J. Garay, Y. Ishai, R. Ostrovsky, Vassilis Zikas
{"title":"The Price of Low Communication in Secure Multi-party Computation","authors":"J. Garay, Y. Ishai, R. Ostrovsky, Vassilis Zikas","doi":"10.1007/978-3-319-63688-7_14","DOIUrl":"https://doi.org/10.1007/978-3-319-63688-7_14","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"102 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122997642","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}
引用次数: 20
Proving Resistance Against Invariant Attacks: How to Choose the Round Constants 证明抵抗不变量攻击:如何选择圆常数
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63715-0_22
Christof Beierle, A. Canteaut, G. Leander, Yann Rotella
{"title":"Proving Resistance Against Invariant Attacks: How to Choose the Round Constants","authors":"Christof Beierle, A. Canteaut, G. Leander, Yann Rotella","doi":"10.1007/978-3-319-63715-0_22","DOIUrl":"https://doi.org/10.1007/978-3-319-63715-0_22","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129584241","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}
引用次数: 61
Amortization with Fewer Equations for Proving Knowledge of Small Secrets 小秘密知识证明的少方程摊销
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63697-9_13
Rafaël del Pino, Vadim Lyubashevsky
{"title":"Amortization with Fewer Equations for Proving Knowledge of Small Secrets","authors":"Rafaël del Pino, Vadim Lyubashevsky","doi":"10.1007/978-3-319-63697-9_13","DOIUrl":"https://doi.org/10.1007/978-3-319-63697-9_13","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130302487","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}
引用次数: 22
Key Rotation for Authenticated Encryption 验证加密的密钥轮换
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63697-9_4
A. Everspaugh, K. Paterson, T. Ristenpart, Samuel Scott
{"title":"Key Rotation for Authenticated Encryption","authors":"A. Everspaugh, K. Paterson, T. Ristenpart, Samuel Scott","doi":"10.1007/978-3-319-63697-9_4","DOIUrl":"https://doi.org/10.1007/978-3-319-63697-9_4","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130163538","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}
引用次数: 63
All-But-Many Lossy Trapdoor Functions from Lattices and Applications 格中的全损陷门函数及其应用
Annual International Cryptology Conference Pub Date : 2017-08-20 DOI: 10.1007/978-3-319-63697-9_11
Xavier Boyen, Qinyi Li
{"title":"All-But-Many Lossy Trapdoor Functions from Lattices and Applications","authors":"Xavier Boyen, Qinyi Li","doi":"10.1007/978-3-319-63697-9_11","DOIUrl":"https://doi.org/10.1007/978-3-319-63697-9_11","url":null,"abstract":"","PeriodicalId":173822,"journal":{"name":"Annual International Cryptology Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126657326","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}
引用次数: 25
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信