找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Cryptology and Network Security; 7th International Co Matthew K. Franklin,Lucas Chi Kwong Hui,Duncan S. Conference proceedings 2008 Spring

[复制链接]
楼主: 尤指植物
发表于 2025-3-23 12:52:03 | 显示全部楼层
发表于 2025-3-23 14:37:21 | 显示全部楼层
Hybrid Damgård Is CCA1-Secure under the DDH Assumptiontem is CPA-secure, the used MAC is unforgeable, the used key-derivation function is secure, and the underlying group is a DDH group. The new cryptosystem is the most efficient known CCA1-secure hybrid cryptosystem based on standard assumptions.
发表于 2025-3-23 18:28:07 | 显示全部楼层
Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bitsrmat factoring on LSBS-RSA, which claims that . and . cannot share more than . least significant bits, where . is the bit-length of .. In conclusion, it is a trade-off between the number of sharing bits and the security level in LSBS-RSA. One should be more careful when using LSBS-RSA with short exponents.
发表于 2025-3-23 22:41:40 | 显示全部楼层
发表于 2025-3-24 04:10:36 | 显示全部楼层
发表于 2025-3-24 07:51:53 | 显示全部楼层
Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups propose a scheme of keyword field-free conjunctive keyword searches on encrypted data, which affirmatively answers an open problem asked by Golle . at . 2004. Furthermore, the proposed scheme is extended to the dynamic group setting. Security analysis of our constructions is given in the paper.
发表于 2025-3-24 14:25:53 | 显示全部楼层
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemest. First, we compute a theoretical bound on the information and security rate for such a secret sharing. Second, we show how to achieve multiple threshold change for a Chinese Remainder Theorem like scheme. We prove that the parameters of this new scheme asymptotically reach the previous bound.
发表于 2025-3-24 15:48:20 | 显示全部楼层
发表于 2025-3-24 21:07:41 | 显示全部楼层
0302-9743 m ciphers and block ciphers, cryptographic foundations, applications and implementations, as well as security in ad hoc networks and wireless sensor networks.978-3-540-89640-1978-3-540-89641-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-25 02:56:50 | 显示全部楼层
Pascalis Raimondos-Møller,Alan D. Woodlande pairing computation is very demanding. Still, pairing-based non-interactive key establishment requires minimal communication and at the same time enjoys excellent properties when used for key distribution.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-30 09:45
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表