標(biāo)題: Titlebook: Cryptology and Network Security; 7th International Co Matthew K. Franklin,Lucas Chi Kwong Hui,Duncan S. Conference proceedings 2008 Spring [打印本頁(yè)] 作者: 尤指植物 時(shí)間: 2025-3-21 19:09
書(shū)目名稱(chēng)Cryptology and Network Security影響因子(影響力)
書(shū)目名稱(chēng)Cryptology and Network Security影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Cryptology and Network Security網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Cryptology and Network Security網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Cryptology and Network Security被引頻次
書(shū)目名稱(chēng)Cryptology and Network Security被引頻次學(xué)科排名
書(shū)目名稱(chēng)Cryptology and Network Security年度引用
書(shū)目名稱(chēng)Cryptology and Network Security年度引用學(xué)科排名
書(shū)目名稱(chēng)Cryptology and Network Security讀者反饋
書(shū)目名稱(chēng)Cryptology and Network Security讀者反饋學(xué)科排名
作者: 使苦惱 時(shí)間: 2025-3-21 23:46 作者: giggle 時(shí)間: 2025-3-22 02:44
Cryptanalysis of MV3 Stream Cipherer provides a distinguishing attack on the MV3 stream cipher. We will show that the key stream generated in MV3 is distinguishable from random sequences after observing approximately 2. bits. That is, in the MV3 cipher with keys of length larger than 63 bits, it is possible to design a key search attack faster than the exhaustive search.作者: 智力高 時(shí)間: 2025-3-22 06:14 作者: Pander 時(shí)間: 2025-3-22 12:10
https://doi.org/10.1007/b138960tem 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.作者: 溫和女孩 時(shí)間: 2025-3-22 16:23 作者: 溫和女孩 時(shí)間: 2025-3-22 17:49
https://doi.org/10.1007/b138960 namely, modified .-CAA problem. Our scheme can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power, such as PDAs or cell phones.作者: Desert 時(shí)間: 2025-3-22 23:34
https://doi.org/10.1007/b138995strating a forgery attack. In this attack, an adversary can forge a valid signature on any messages. Therefore, their signature schemes cannot guarantee the security of AODV and DSR protocols. We also show that their generic construction of identity-based multisignature from identity-based online/offline signature is not secure.作者: 隱藏 時(shí)間: 2025-3-23 02:13
Web Component Development with Zope 3 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.作者: blister 時(shí)間: 2025-3-23 06:14 作者: 梯田 時(shí)間: 2025-3-23 12:52 作者: Protein 時(shí)間: 2025-3-23 14:37
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.作者: 過(guò)度 時(shí)間: 2025-3-23 18:28
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.作者: 全部 時(shí)間: 2025-3-23 22:41 作者: 漫步 時(shí)間: 2025-3-24 04:10 作者: 停止償付 時(shí)間: 2025-3-24 07:51
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.作者: FLEET 時(shí)間: 2025-3-24 14:25
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.作者: 演講 時(shí)間: 2025-3-24 15:48 作者: Charade 時(shí)間: 2025-3-24 21:07
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 作者: 烤架 時(shí)間: 2025-3-25 02:56
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.作者: expository 時(shí)間: 2025-3-25 06:50
A Killer Application for Pairings: Authenticated Key Establishment in Underwater Wireless Sensor Nete 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.作者: ANA 時(shí)間: 2025-3-25 11:30
0302-9743 ng-Kong, China, in December 2008. The 27 revised full papers presented were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on cryptosystems, signatures, identification, authentication and key management, cryptographic algorithms and protocols, strea作者: Omnipotent 時(shí)間: 2025-3-25 12:38
https://doi.org/10.1007/b138960ent scenarios. The aim of this paper is twofold. Firstly, we summarize different properties in the literature and gives some generic conversions between them. We propose a security model to capture most of these properties. Secondly, we present the . concrete construction of sanitizable signatures which is proven secure in the standard model.作者: 清洗 時(shí)間: 2025-3-25 16:01
Presenting components on the weber provides a distinguishing attack on the MV3 stream cipher. We will show that the key stream generated in MV3 is distinguishable from random sequences after observing approximately 2. bits. That is, in the MV3 cipher with keys of length larger than 63 bits, it is possible to design a key search attack faster than the exhaustive search.作者: antipsychotic 時(shí)間: 2025-3-25 23:41 作者: 帶來(lái) 時(shí)間: 2025-3-26 01:25 作者: Connotation 時(shí)間: 2025-3-26 06:11 作者: 貴族 時(shí)間: 2025-3-26 10:55 作者: intellect 時(shí)間: 2025-3-26 15:26
Efficient Dynamic Broadcast Encryption and Its Extension to Authenticated Dynamic Broadcast Encrypti that enables receivers to verify the producer of broadcasted content. In ., we adopt the signature scheme proposed by Barreto et al. [3]. To our knowledge, . is the first scheme that achieves provable security for broadcast encryption and signature with common parameters and keys.作者: EXULT 時(shí)間: 2025-3-26 17:08
Cryptanalysis of EC-RAC, a RFID Identification Protocolely eavesdropped three times..We propose a new scheme based on a modification of the Schnorr scheme as efficient as the initial scheme. We prove that this scheme is zero-knowledge, sound against active adversaries. Moreover, our proposal is private under the Decisional Diffie-Hellman assumption.作者: 字形刻痕 時(shí)間: 2025-3-26 22:15 作者: MERIT 時(shí)間: 2025-3-27 01:16 作者: COLIC 時(shí)間: 2025-3-27 05:35
Cryptology and Network Security978-3-540-89641-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 繼而發(fā)生 時(shí)間: 2025-3-27 10:03 作者: 擋泥板 時(shí)間: 2025-3-27 16:48
Authentication and user managementbenius map, an efficient scalar multiplication method for pairing–friendly elliptic curve . is shown. According to the simulation result, a scalar multiplication by the proposed method with multi–exponentiation technique is about 40% faster than that by plain binary method.作者: CRACY 時(shí)間: 2025-3-27 17:49
The Zope 3 Component ArchitectureBased on a [.,.,.?+?1]-code ., an approach to construct (., ., .) resilient functions with multiple cryptographic criteria including high nonlinearity, high algebraic degree and nonexistence of nonzero linear structure is described. Particularly, when .?=?2., this kind of construction can be made simply.作者: foppish 時(shí)間: 2025-3-28 01:24
Construction of Resilient Functions with Multiple Cryptographic CriteriaBased on a [.,.,.?+?1]-code ., an approach to construct (., ., .) resilient functions with multiple cryptographic criteria including high nonlinearity, high algebraic degree and nonexistence of nonzero linear structure is described. Particularly, when .?=?2., this kind of construction can be made simply.作者: configuration 時(shí)間: 2025-3-28 04:31 作者: Genome 時(shí)間: 2025-3-28 10:17 作者: Boycott 時(shí)間: 2025-3-28 12:00
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/240611.jpg作者: 低能兒 時(shí)間: 2025-3-28 18:09
https://doi.org/10.1007/b138960ut learning the underlying plaintext. Proxy re-encryption has found many practical applications, such as encrypted email forwarding, secure distributed file systems, and outsourced filtering of encrypted spam. In ACM CCS’07, Canetti and Hohenberger presented a proxy re-encryption scheme with chosen-作者: 狼群 時(shí)間: 2025-3-28 22:39 作者: Extricate 時(shí)間: 2025-3-29 02:03
https://doi.org/10.1007/b138960. The computational cost and the encryption (public) key size are more efficient than the original scheme. We observe that by using a decryption key in the original scheme, we can encrypt a message more efficiently without a part of an encryption key. In order to let any user receive this benefit, w作者: Emg827 時(shí)間: 2025-3-29 04:29
https://doi.org/10.1007/b138960 of short exponent LSBS-RSA. They claimed that short exponent LSBS-RSA is much more vulnerable to the lattice attack than the standard RSA. In this paper, we further raise the security boundary of the Zhao-Qi attack by considering another polynomial. Our improvemet supports the result of analogue Fe作者: SUE 時(shí)間: 2025-3-29 08:59 作者: 友好 時(shí)間: 2025-3-29 12:16
https://doi.org/10.1007/b138960ut interacting with the signer. There exists many security models, properties and constructions for sanitizable signatures, which are useful in different scenarios. The aim of this paper is twofold. Firstly, we summarize different properties in the literature and gives some generic conversions betwe作者: 合法 時(shí)間: 2025-3-29 16:47 作者: RAG 時(shí)間: 2025-3-29 20:48
https://doi.org/10.1007/b138995roposed an identity-based online/offline signature scheme for authentication in the AODV protocol and then transformed this scheme to an identity-based multisignature scheme which is suitable for the DSR protocol. In this paper, we show that their schemes cannot achieve the claimed security by demon作者: flamboyant 時(shí)間: 2025-3-30 02:21 作者: RAG 時(shí)間: 2025-3-30 04:05 作者: AMPLE 時(shí)間: 2025-3-30 11:33 作者: analogous 時(shí)間: 2025-3-30 14:32
The Zope 3 Component Architectureputed is ..(..,...,..) :?=?.. ·...·.. where each participant .. holds an input .. from the non-commutative group .. The settings of their study are the passive adversary model, information-theoretic security and black-box group operations over ...They presented three results. The first one is that h作者: palette 時(shí)間: 2025-3-30 20:05 作者: anaphylaxis 時(shí)間: 2025-3-30 22:02
The Zope 3 Component Architecturelikely to increase over time. In order to deal with this issue, one may also require to have the ability to increase the threshold value from . to .′(?>?.), such an increment is likely to happen several times..In this paper, we study the problem of threshold changeability in a dealer-free environmen作者: 慷慨不好 時(shí)間: 2025-3-31 02:28 作者: 只有 時(shí)間: 2025-3-31 08:41 作者: MENT 時(shí)間: 2025-3-31 11:17
Presenting components on the web192 bits, the security claim of MV3 is that no attack faster than the exhaustive key search can be mounted for keys of length up to 256 bits..This paper provides a distinguishing attack on the MV3 stream cipher. We will show that the key stream generated in MV3 is distinguishable from random sequenc作者: ticlopidine 時(shí)間: 2025-3-31 16:01 作者: asthma 時(shí)間: 2025-3-31 20:46
Chosen-Ciphertext Secure Proxy Re-encryption without Pairingsut learning the underlying plaintext. Proxy re-encryption has found many practical applications, such as encrypted email forwarding, secure distributed file systems, and outsourced filtering of encrypted spam. In ACM CCS’07, Canetti and Hohenberger presented a proxy re-encryption scheme with chosen-作者: patella 時(shí)間: 2025-3-31 21:54
Hybrid Damg?rd Is CCA1-Secure under the DDH Assumptionsteen proved its CCA1-security under a more standard but still new and strong assumption. The known CCA2-secure public-key cryptosystems are considerably more complicated. We propose a hybrid variant of Damg?rd’s public-key cryptosystem and show that it is CCA1-secure if the used symmetric cryptosys作者: Blasphemy 時(shí)間: 2025-4-1 02:18 作者: gangrene 時(shí)間: 2025-4-1 08:49
Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits of short exponent LSBS-RSA. They claimed that short exponent LSBS-RSA is much more vulnerable to the lattice attack than the standard RSA. In this paper, we further raise the security boundary of the Zhao-Qi attack by considering another polynomial. Our improvemet supports the result of analogue Fe作者: 誘拐 時(shí)間: 2025-4-1 10:18
Efficient and Short Certificateless Signature in both communication and computation, and therefore turns out to be more efficient than other CLS schemes proposed so far. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the .-CAA hard problem and a new discovered hard problem,
