找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 尤指植物
11#
發(fā)表于 2025-3-23 12:52:03 | 只看該作者
12#
發(fā)表于 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.
13#
發(fā)表于 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.
14#
發(fā)表于 2025-3-23 22:41:40 | 只看該作者
15#
發(fā)表于 2025-3-24 04:10:36 | 只看該作者
16#
發(fā)表于 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.
17#
發(fā)表于 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.
18#
發(fā)表于 2025-3-24 15:48:20 | 只看該作者
19#
發(fā)表于 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
20#
發(fā)表于 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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-31 15:48
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
黑山县| 吉林市| 古浪县| 荆门市| 镇江市| 洛南县| 青海省| 呼玛县| 星座| 靖边县| 西平县| 长子县| 大渡口区| 保靖县| 塔河县| 南江县| 漠河县| 荔波县| 长丰县| 达孜县| 德兴市| 定南县| 色达县| 当阳市| 宝兴县| 云和县| 杨浦区| 加查县| 许昌县| 长顺县| 海晏县| 镇雄县| 麻阳| 黄山市| 祁东县| 万州区| 咸阳市| 轮台县| 安新县| 武夷山市| 马公市|