找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Topics in Cryptology -- CT-RSA 2003; The Cryptographers‘ Marc Joye Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003 RSA.

[复制链接]
查看: 13594|回复: 35
发表于 2025-3-21 19:04:55 | 显示全部楼层 |阅读模式
书目名称Topics in Cryptology -- CT-RSA 2003
副标题The Cryptographers‘
编辑Marc Joye
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Topics in Cryptology -- CT-RSA 2003; The Cryptographers‘  Marc Joye Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003 RSA.
出版日期Conference proceedings 2003
关键词RSA; RSA cryptosystems; anonymity; authentication; calculus; cryptographic protocolls; cryptography; crypto
版次1
doihttps://doi.org/10.1007/3-540-36563-X
isbn_softcover978-3-540-00847-7
isbn_ebook978-3-540-36563-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2003
The information of publication is updating

书目名称Topics in Cryptology -- CT-RSA 2003影响因子(影响力)




书目名称Topics in Cryptology -- CT-RSA 2003影响因子(影响力)学科排名




书目名称Topics in Cryptology -- CT-RSA 2003网络公开度




书目名称Topics in Cryptology -- CT-RSA 2003网络公开度学科排名




书目名称Topics in Cryptology -- CT-RSA 2003被引频次




书目名称Topics in Cryptology -- CT-RSA 2003被引频次学科排名




书目名称Topics in Cryptology -- CT-RSA 2003年度引用




书目名称Topics in Cryptology -- CT-RSA 2003年度引用学科排名




书目名称Topics in Cryptology -- CT-RSA 2003读者反馈




书目名称Topics in Cryptology -- CT-RSA 2003读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:26:33 | 显示全部楼层
Intrusion-Resilient Public-Key Encryptione notion of . [.] (which extends both the notions of . [.], [.] and . [.]) was proposed as a means of mitigating the harmful effects that key exposure can have. In this model, time is divided into distinct periods; the public key remains fixed throughout the lifetime of the protocol but the secret k
发表于 2025-3-22 02:32:29 | 显示全部楼层
TMAC: Two-Key CBC MACrequires only (. + .)-bit keys while XCBC requires (. + 2.)-bit keys, where . is the key length of the underlying block cipher . and . is its block length. We achieve this by using a universal hash function and the cost is almost negligible. Similar to XCBC, the domain is 0, 1. and it requires no ex
发表于 2025-3-22 07:24:10 | 显示全部楼层
Montgomery Prime Hashing for Message Authentication as the Montgomery residue of the message with respect to a secret modulus.T he modulus value is structured in a way that allows fast, compact implementations in both hardware and software.Th e set of allowed modulus values is large, and as a result, MPH achieves good, provable security..MPH perform
发表于 2025-3-22 09:31:05 | 显示全部楼层
An Analysis of Proxy Signatures: Is a Secure Channel Necessary?er. In this paper, we discuss the necessity of a secure channel in proxy signatures. Though establishing a secure channel has much influence on the efficiency of the scheme, to the best of our knowledge, this topic has not been discussed before. All known proxy signatures used a secure channel to de
发表于 2025-3-22 16:16:36 | 显示全部楼层
发表于 2025-3-22 20:42:48 | 显示全部楼层
发表于 2025-3-22 23:53:25 | 显示全部楼层
Access Control Using Pairing Based Cryptography decryptor is defined by a logical formulae of conjunctions and disjunctions. This enables a simple mechanism to drive access control to broadcast encrypted data using user identities as the public keys.
发表于 2025-3-23 03:22:02 | 显示全部楼层
发表于 2025-3-23 06:57:02 | 显示全部楼层
About the XL Algorithm over ,(2)a finite field. At Asiacrypt 2002, Courtois and Pieprzyk show that the MQ problem is also relevant to the security of AES. At Eurocrypt 2000, Courtois, Klimov, Patarin and Shamir introduced the XL algorithm for solving MQ. They show that if the number of equations . is much larger than the number of
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-26 10:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表