標(biāo)題: Titlebook: Cryptology and Network Security; 10th International C Dongdai Lin,Gene Tsudik,Xiaoyun Wang Conference proceedings 2011 Springer-Verlag GmbH [打印本頁] 作者: 連結(jié) 時間: 2025-3-21 16:41
書目名稱Cryptology and Network Security影響因子(影響力)
書目名稱Cryptology and Network Security影響因子(影響力)學(xué)科排名
書目名稱Cryptology and Network Security網(wǎng)絡(luò)公開度
書目名稱Cryptology and Network Security網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Cryptology and Network Security被引頻次
書目名稱Cryptology and Network Security被引頻次學(xué)科排名
書目名稱Cryptology and Network Security年度引用
書目名稱Cryptology and Network Security年度引用學(xué)科排名
書目名稱Cryptology and Network Security讀者反饋
書目名稱Cryptology and Network Security讀者反饋學(xué)科排名
作者: 細(xì)頸瓶 時間: 2025-3-21 21:10 作者: 糾纏 時間: 2025-3-22 03:28
New Impossible Differential Cryptanalysis of Reduced-Round Camelliaossible differential of Camellia including ./.. layer. Utilizing impossible differential attack, 10-round Camellia-128 is breakable with 2. chosen plaintexts and 2. 10 round encryptions. Moreover, 10-round Camellia-192 and 11-round Camellia-256 can also be analyzed, the time complexity are about 2. 作者: sed-rate 時間: 2025-3-22 05:13 作者: ACE-inhibitor 時間: 2025-3-22 10:12
Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48 rounds of PRINTCipher-48 and 9 rounds under some additional assumptions with only 2 known plaintexts faster than brute force. We show that it is possible to break the full 48-round cipher by assuming a moderate leakage of internal state bits or even just Hamming weights of some three-bit states. Su作者: –FER 時間: 2025-3-22 15:09
EPCBC - A Block Cipher Suitable for Electronic Product Code Encryptionode (EPC) encryption, which uses low-cost passive RFID-tags and exactly 96 bits as a unique identifier on the item level. EPCBC is based on a generalized PRESENT with block size 48 and 96 bits for the main cipher structure and customized key schedule design which provides strong protection against r作者: –FER 時間: 2025-3-22 20:07
On Permutation Layer of Type 1, Source-Heavy, and Target-Heavy Generalized Feistel Structureslayers. For Type 2 GFS, at FSE 2010, Suzaki and Minematsu showed that a better diffusion property can be obtained if one uses some other sub-block-wise permutation. In this paper, we consider Type 1, Source-Heavy (SH), and Target-Heavy (TH) GFSs, and study if their diffusion properties can be improv作者: aphasia 時間: 2025-3-22 22:01
Security Analysis of an Improved MFE Public Key Cryptosystemng et al gave an improvement of MFE. They claimed that the improved MFE is secure against high order linearization equation attack. However, through theoretical analysis, we find that there are many first order linearization equations(FOLEs) satisfied by this improved version. Using linearization eq作者: padding 時間: 2025-3-23 03:47 作者: Limited 時間: 2025-3-23 07:29 作者: anticipate 時間: 2025-3-23 12:39 作者: 不透氣 時間: 2025-3-23 14:23
Cryptanalysis of a Provably Secure Cross-Realm Client-to-Client Password-Authenticated Key Agreementm settings proposed at CANS ’09. While client-to-client password-authenticated key exchange (C2C-PAKE) protocols exist in literature, what is interesting about this one is that it is the only such protocol claimed to offer security against password compromise impersonation without depending on publi作者: 詞匯表 時間: 2025-3-23 22:02
Passive Attack on RFID LMAP++ Authentication Protocolly logical operator XOR and modular 2. addition. In this paper, a passive attack on LMAP++ protocol is given after constructing the distinguisher for the random numbers used in the protocol. The attack shows the protocol cannot resist passive attack, and after eavesdropping about 480 authentication 作者: 話 時間: 2025-3-24 02:15 作者: 條約 時間: 2025-3-24 04:06 作者: podiatrist 時間: 2025-3-24 08:41 作者: 白楊 時間: 2025-3-24 12:36
AniCAP: An Animated 3D CAPTCHA Scheme Based on Motion Parallaxmes have been proposed and deployed on various websites to secure online services from abuse by automated programs. However, many of these CAPTCHAs have been found to suffer from design flaws that can be exploited to break the CAPTCHA. Hence, the development of a good CAPTCHA scheme that is both sec作者: 事物的方面 時間: 2025-3-24 16:14
Towards Attribute Revocation in Key-Policy Attribute Based Encryptionon of the user’s identity, which could only revoke the user’s whole attributes by revoking the user’s identity. In some cases, we wish to revoke one attribute of a user instead of the whole attributes issued to him without affecting any other user’s private key, such that the user still can use his 作者: ABYSS 時間: 2025-3-24 21:15 作者: LINE 時間: 2025-3-25 01:05 作者: grieve 時間: 2025-3-25 03:53 作者: 脫落 時間: 2025-3-25 09:03
y Pan and Deng shows that it is not secure. In this paper, we present a new efficient lattice-based public-key cryptosystem mixed with a knapsack, which can resist Pan and Deng’s attack well. What’s more, it has reasonable key size, quick encryption and decryption. However, we have to point out that the new cryptosystem has no security proof.作者: Canyon 時間: 2025-3-25 12:51
Kriterien zur Schadensbewertung,In this survey, we review a number of the many “expressive” encryption systems that have recently appeared from lattices, and explore the innovative techniques that underpin them.作者: catagen 時間: 2025-3-25 17:34 作者: 尊嚴(yán) 時間: 2025-3-25 20:11 作者: 食料 時間: 2025-3-26 03:22
Kriterien zur Schadensbewertung,has been employed in many Mifare Classic RFID products, Hitag2 is used by many car manufacturers for unlocking car doors remotely. Until now, except the brute force attack, only one cryptanalysis on this cipher was released by Courtois, O’Neil and Quisquater, which broke Hitag2 by an SAT solver with作者: Audiometry 時間: 2025-3-26 05:02
Kriterien zur Werkstoffauswahl,ossible differential of Camellia including ./.. layer. Utilizing impossible differential attack, 10-round Camellia-128 is breakable with 2. chosen plaintexts and 2. 10 round encryptions. Moreover, 10-round Camellia-192 and 11-round Camellia-256 can also be analyzed, the time complexity are about 2. 作者: Cabg318 時間: 2025-3-26 12:11
,Thermisch aktivierte Vorg?nge,this paper, we analyze the initialization stage of ZUC v1.5. First of all, we study the differential properties of operations in ZUC v1.5, including the bit-reorganization, exclusive-or and addition modulo 2., bit shift and the update of LFSR. And then we give a differential trail covering 24 rounds作者: 大漩渦 時間: 2025-3-26 16:08 作者: definition 時間: 2025-3-26 19:36
Atomarer Aufbau kristalliner Stoffe,ode (EPC) encryption, which uses low-cost passive RFID-tags and exactly 96 bits as a unique identifier on the item level. EPCBC is based on a generalized PRESENT with block size 48 and 96 bits for the main cipher structure and customized key schedule design which provides strong protection against r作者: 極少 時間: 2025-3-27 00:00
layers. For Type 2 GFS, at FSE 2010, Suzaki and Minematsu showed that a better diffusion property can be obtained if one uses some other sub-block-wise permutation. In this paper, we consider Type 1, Source-Heavy (SH), and Target-Heavy (TH) GFSs, and study if their diffusion properties can be improv作者: 古文字學(xué) 時間: 2025-3-27 03:01
ng et al gave an improvement of MFE. They claimed that the improved MFE is secure against high order linearization equation attack. However, through theoretical analysis, we find that there are many first order linearization equations(FOLEs) satisfied by this improved version. Using linearization eq作者: prediabetes 時間: 2025-3-27 08:56
y Pan and Deng shows that it is not secure. In this paper, we present a new efficient lattice-based public-key cryptosystem mixed with a knapsack, which can resist Pan and Deng’s attack well. What’s more, it has reasonable key size, quick encryption and decryption. However, we have to point out that作者: 俗艷 時間: 2025-3-27 11:43 作者: Friction 時間: 2025-3-27 16:26
ration for commercial applications. It became publicly available in 2010 and since then it was neither attacked nor proved to be secure. In this paper, we show that the SM2 key exchange protocol is insecure by presenting realistic attacks in the Canetti-Krawczyk model. The demonstrated attack breaks作者: 面包屑 時間: 2025-3-27 17:56 作者: obeisance 時間: 2025-3-27 22:12 作者: Gyrate 時間: 2025-3-28 04:40
er prove possession of this certified credential to another party, while minimizing the information given to the latter. At CANS 2010, Guajardo, Mennink and Schoenmakers have introduced the concept of anonymous credential schemes with encrypted attributes, where the attributes to be certified are en作者: indoctrinate 時間: 2025-3-28 09:54
Henrique Paques,Ling Liu,Calton Puethods require linear amount of work to be performed by unrevoked signers or verifiers, who usually have to obtain fresh update information (sometimes of linear size) published by the group manager. We overcome these disadvantages by proposing a novel group signature scheme, where computation costs 作者: 泥沼 時間: 2025-3-28 10:51 作者: 矛盾心理 時間: 2025-3-28 14:36 作者: THE 時間: 2025-3-28 20:09
Henrique Paques,Ling Liu,Calton Puon of the user’s identity, which could only revoke the user’s whole attributes by revoking the user’s identity. In some cases, we wish to revoke one attribute of a user instead of the whole attributes issued to him without affecting any other user’s private key, such that the user still can use his 作者: AXIOM 時間: 2025-3-29 00:17 作者: 疼死我了 時間: 2025-3-29 06:52
978-3-642-25512-0Springer-Verlag GmbH Berlin Heidelberg 2011作者: 過剩 時間: 2025-3-29 08:19
Dongdai Lin,Gene Tsudik,Xiaoyun WangState-of-the-art research.Fast-track conference proceedings.Unique visibility作者: 白楊 時間: 2025-3-29 12:24 作者: ambivalence 時間: 2025-3-29 19:12
Kriterien zur Schadensbewertung,r can be broken within one minute on a PC. The attack is composed of three phases: a black-box attack of extracting 32 bits of the secret key, a white-box attack to get several other key bits, and a brute force search for the remaining key bits.作者: outset 時間: 2025-3-29 19:56
Atomarer Aufbau kristalliner Stoffe, bounds otherwise. Further, we analyze the resistance of EPCBC against integral cryptanalysis, statistical saturation attack, slide attack, algebraic attack and the latest higher-order differential cryptanalysis from FSE 2011?[11]. Our proposed cipher would be the most efficient at EPC encryption, s作者: Lineage 時間: 2025-3-30 03:44
this problem: our multi-show anonymous credential scheme with encrypted attributes relies on the non-interactive Groth-Sahai proof system and the recent work on commuting signatures from Fuchsbauer (Eurocrypt 2011) and is proven secure in the standard model.作者: epinephrine 時間: 2025-3-30 07:32 作者: Optic-Disk 時間: 2025-3-30 11:03
Cube Cryptanalysis of Hitag2 Stream Cipherr can be broken within one minute on a PC. The attack is composed of three phases: a black-box attack of extracting 32 bits of the secret key, a white-box attack to get several other key bits, and a brute force search for the remaining key bits.作者: 鼓掌 時間: 2025-3-30 13:50
EPCBC - A Block Cipher Suitable for Electronic Product Code Encryption bounds otherwise. Further, we analyze the resistance of EPCBC against integral cryptanalysis, statistical saturation attack, slide attack, algebraic attack and the latest higher-order differential cryptanalysis from FSE 2011?[11]. Our proposed cipher would be the most efficient at EPC encryption, s作者: 悲痛 時間: 2025-3-30 20:31
Multi-show Anonymous Credentials with Encrypted Attributes in the Standard Model this problem: our multi-show anonymous credential scheme with encrypted attributes relies on the non-interactive Groth-Sahai proof system and the recent work on commuting signatures from Fuchsbauer (Eurocrypt 2011) and is proven secure in the standard model.作者: breadth 時間: 2025-3-30 21:00 作者: 修剪過的樹籬 時間: 2025-3-31 04:14 作者: deciduous 時間: 2025-3-31 05:56 作者: pester 時間: 2025-3-31 11:27
Fast Computation on Encrypted Polynomials and Applicationsefulness by utilizing them to solve two problems from the literature, namely the oblivious polynomial evaluation (OPE) and the private set intersection but expect the techniques to be applicable to other problems as well.作者: ingestion 時間: 2025-3-31 15:08 作者: 拉開這車床 時間: 2025-3-31 18:42
0302-9743 rnational Conference on Cryptology and Network Security, CANS 2011, held in Sanya, China, in December 2011. The 18 revised full papers, presented were carefully reviewed and selected from 65 submissions. The book also includes two invited talks. The papers are organized in topical sections on symmet作者: monochromatic 時間: 2025-3-31 21:55 作者: 北極熊 時間: 2025-4-1 05:34 作者: Criteria 時間: 2025-4-1 06:10 作者: 調(diào)整校對 時間: 2025-4-1 10:45 作者: 掃興 時間: 2025-4-1 16:26 作者: Commonplace 時間: 2025-4-1 22:33
