找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advances in Cryptology – ASIACRYPT 2017; 23rd International C Tsuyoshi Takagi,Thomas Peyrin Conference proceedings 2017 International Assoc

[复制链接]
查看: 22930|回复: 53
发表于 2025-3-21 16:39:05 | 显示全部楼层 |阅读模式
期刊全称Advances in Cryptology – ASIACRYPT 2017
期刊简称23rd International C
影响因子2023Tsuyoshi Takagi,Thomas Peyrin
视频video
发行地址Includes supplementary material:
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Advances in Cryptology – ASIACRYPT 2017; 23rd International C Tsuyoshi Takagi,Thomas Peyrin Conference proceedings 2017 International Assoc
影响因子The three-volume set LNCS 10624, 10625, 10626 constitutes the refereed proceedings of the 23rd International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2017, held in Hong Kong, China, in December 2017..The 65 revised full papers  were carefully selected from 243 submissions. They are organized in topical sections on Post-Quantum Cryptography; Symmetric Key Cryptanalysis; Lattices; Homomorphic Encryptions; Access Control; Oblivious Protocols; Side Channel Analysis; Pairing-based Protocols; Quantum Algorithms; Elliptic Curves; Block Chains; Multi-Party Protocols; Operating Modes Security Proofs; Cryptographic Protocols; Foundations; Zero-Knowledge Proofs; and Symmetric Key Designs..
Pindex Conference proceedings 2017
The information of publication is updating

书目名称Advances in Cryptology – ASIACRYPT 2017影响因子(影响力)




书目名称Advances in Cryptology – ASIACRYPT 2017影响因子(影响力)学科排名




书目名称Advances in Cryptology – ASIACRYPT 2017网络公开度




书目名称Advances in Cryptology – ASIACRYPT 2017网络公开度学科排名




书目名称Advances in Cryptology – ASIACRYPT 2017被引频次




书目名称Advances in Cryptology – ASIACRYPT 2017被引频次学科排名




书目名称Advances in Cryptology – ASIACRYPT 2017年度引用




书目名称Advances in Cryptology – ASIACRYPT 2017年度引用学科排名




书目名称Advances in Cryptology – ASIACRYPT 2017读者反馈




书目名称Advances in Cryptology – ASIACRYPT 2017读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:44:56 | 显示全部楼层
发表于 2025-3-22 01:38:38 | 显示全部楼层
The Growth of the Capital Creation Systemlose this gap by proposing a new construction paradigm for ring signatures without random oracles: We show how to efficiently instantiate full-fledged ring signatures from signature schemes with re-randomizable keys and non-interactive zero-knowledge. We obtain the following results:
发表于 2025-3-22 07:18:32 | 显示全部楼层
Capital and Systems Measurementalgorithm is proposed, which finds an .-collision of any function that has a domain size . times larger than the codomain size. A rigorous proof is given to guarantee that the expected number of quantum queries is . for a small constant ., which matches the tight bound of . for . and improves the known bounds, say, the above simple bound of ..
发表于 2025-3-22 12:25:50 | 显示全部楼层
Richard Thomas Watson,Saji K. Mathewnd 32-bit ARM Cortex M0 platforms. We find that qDSA significantly outperforms state-of-the-art signature implementations in terms of stack usage and code size. We also include an efficient compression algorithm for points on fast Kummer surfaces, reducing them to the same size as compressed elliptic curve points for the same security level.
发表于 2025-3-22 14:49:29 | 显示全部楼层
Richard Thomas Watson,Saji K. Mathewof the underlying problems. Our techniques lead to heuristic polynomial-time key recovery on two non-standard variants of De Feo-Jao-Plût’s protocols in plausible attack models. This shows that at least some isogeny problems are easier to solve when additional information is leaked.
发表于 2025-3-22 17:46:25 | 显示全部楼层
0302-9743 l Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2017, held in Hong Kong, China, in December 2017..The 65 revised full papers  were carefully selected from 243 submissions. They are organized in topical sections on Post-Quantum Cryptography; Symmetric Key
发表于 2025-3-22 21:24:21 | 显示全部楼层
https://doi.org/10.1007/978-0-387-98169-7lpable soundness of the third subargument under a KerMDH assumption. This proves the soundness of the shuffle argument. We also discuss our partially optimized implementation that allows one to prove a shuffle of . ciphertexts in less than a minute and verify it in less than 1.5 min.
发表于 2025-3-23 02:31:49 | 显示全部楼层
Conference proceedings 2017ptions; Access Control; Oblivious Protocols; Side Channel Analysis; Pairing-based Protocols; Quantum Algorithms; Elliptic Curves; Block Chains; Multi-Party Protocols; Operating Modes Security Proofs; Cryptographic Protocols; Foundations; Zero-Knowledge Proofs; and Symmetric Key Designs..
发表于 2025-3-23 08:35:08 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-20 16:29
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表