標(biāo)題: Titlebook: Cryptology and Network Security; 5th International Co David Pointcheval,Yi Mu,Kefei Chen Conference proceedings 2006 Springer-Verlag Berlin [打印本頁(yè)] 作者: 中產(chǎn)階級(jí) 時(shí)間: 2025-3-21 19:02
書(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é)科排名
作者: 貿(mào)易 時(shí)間: 2025-3-21 22:47
Efficient Identity-Based Encryption with Tight Security Reductionconcept was introduced by Shamir. Their scheme achieves chosen-ciphertext security (. secure in the sense of .); however, the security reduction is far from being tight..In this paper, we present an efficient variant of the Boneh-Franklin scheme that achieves a tight security reduction. Our scheme i作者: nauseate 時(shí)間: 2025-3-22 01:20 作者: Range-Of-Motion 時(shí)間: 2025-3-22 08:35 作者: heirloom 時(shí)間: 2025-3-22 09:44 作者: 一窩小鳥(niǎo) 時(shí)間: 2025-3-22 13:51 作者: 一窩小鳥(niǎo) 時(shí)間: 2025-3-22 18:28 作者: FRAUD 時(shí)間: 2025-3-23 00:27
Security Model of Proxy-Multi Signature Schemesas been done in proxy-multi signature schemes, until now there is no formalized definition and security model for them. In this paper, we will give the formal definition and a security model of proxy-multi signature scheme. We also constructed a proxy-multi signature scheme based on the BLS short si作者: aneurysm 時(shí)間: 2025-3-23 03:56
Efficient ID-Based One-Time Proxy Signature and Its Application in E-Chequeur best knowledge, although plenty of one-time proxy signature schemes have been proposed, no ID-based one-time proxy signature (IBOTPS) has yet been presented. Therefore, in this paper, to fill this void, we first formalize the security notions for IBOTPS, and propose the first efficient IBOTPS sch作者: Gene408 時(shí)間: 2025-3-23 06:52
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields practical applications, it is crucial to provide efficient and secure implementations of the pairings. There have been several works on efficient implementations of the pairings. However, the research for secure implementations of the pairings has not been thoroughly investigated. In this paper, we作者: 結(jié)束 時(shí)間: 2025-3-23 13:32
Improved Collision Attack on Reduced Round Camelliaoject. Wu Wenling presented the collision attack on reduced-round Camellia in 2004, the 128-bit key of 6 rounds Camellia can be recovered with 2. chosen plaintexts and 2. encryptions. The improved collision attack on 6 rounds Camellia which based on four 4-round distinguishers is presented in this p作者: Germinate 時(shí)間: 2025-3-23 14:19
Stealing Secrets with SSL/TLS and SSH – Kleptographic Attacksphic library, to steal secrets of the user. According to the scenario of the kleptographic attacks the secrets can be stolen only by a party having a secret key not included in the manipulated code. The attacker needs only to record transmissions. The messages transmitted are indistinguishable from 作者: echnic 時(shí)間: 2025-3-23 21:02
Bitslice Implementation of AESance of the application, the speeds of encryption and decryption of the algorithm are critical. To obtain maximum performance from the algorithm, efficient techniques for its implementation must be used and the implementation must be tuned for the specific hardware on which it is running..Bitslice i作者: 初次登臺(tái) 時(shí)間: 2025-3-24 01:45 作者: 僵硬 時(shí)間: 2025-3-24 03:09 作者: 防止 時(shí)間: 2025-3-24 09:54
Watermarking Essential Data Structures for Copyright Protectionng copyright signatures inside the program code or its runtime state. Prior proposals hide the watermarks in dummy data structures, e.g., linked lists and graphs that are created during the execution of the hosting software for this reason. This makes it vulnerable to subtractive attacks, because th作者: Resistance 時(shí)間: 2025-3-24 12:14 作者: 揮舞 時(shí)間: 2025-3-24 16:20
Chaotic Keystream Generator Using Coupled NDFs with Parameter Perturbingwork on the well characterized one-dimensional(1-D) chaotic systems. As a practical solution to these problems caused by 1-D chaotic systems, a chaotic keystream generator using nonlinear digital filters with .-D uniform distribution is proposed. To improve system security further and overcome the e作者: BRIEF 時(shí)間: 2025-3-24 19:43
https://doi.org/10.1007/11935070AES; DDos attacks; Distributed Denial of Service; algorithm; algorithms; authentication; communication; cry作者: FILLY 時(shí)間: 2025-3-25 00:55
978-3-540-49462-1Springer-Verlag Berlin Heidelberg 2006作者: Bridle 時(shí)間: 2025-3-25 03:27
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over ,(3) is a prime number, and 3 is a primitive root modulo .. . The algorithm presented here generalizes the fast algorithm to determine the linear complexity of a sequence over .(.) with period .., where . is a prime, . is a prime and a primitive root modulo ...作者: macrophage 時(shí)間: 2025-3-25 08:22 作者: REP 時(shí)間: 2025-3-25 13:53 作者: Malaise 時(shí)間: 2025-3-25 19:51
Shorter Verifier-Local Revocation Group Signatures from Bilinear MapsWe propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous ones.作者: 有效 時(shí)間: 2025-3-25 23:49
Authentication and user managementk in the standard model, from the Cramer-Shoup and Kurosawa-Desmedt constructions. The schemes obtained are quite efficient. In fact, the Cramer-Shoup derived schemes are more efficient than the previous schemes from this construction, including the Cramer-Shoup cryptosystem, when long messages are 作者: Flatus 時(shí)間: 2025-3-26 03:38
Authentication and user managementconcept was introduced by Shamir. Their scheme achieves chosen-ciphertext security (. secure in the sense of .); however, the security reduction is far from being tight..In this paper, we present an efficient variant of the Boneh-Franklin scheme that achieves a tight security reduction. Our scheme i作者: 禮節(jié) 時(shí)間: 2025-3-26 07:01 作者: 哥哥噴涌而出 時(shí)間: 2025-3-26 10:09 作者: 教育學(xué) 時(shí)間: 2025-3-26 14:05 作者: 撫育 時(shí)間: 2025-3-26 18:04
The Zope 3 Component Architecturestandards for short range wireless communication. All such key exchange protocols employ data authentication as an unavoidable subtask. As a solution, we propose an asymptotically optimal protocol family for data authentication that uses short manually authenticated out-of-band messages. Compared to作者: amygdala 時(shí)間: 2025-3-27 00:05
Authentication and user managementect data. In such a network model, packet overhead and computing efficiency are important parameters to be taken into account when designing a multicast authentication protocol. Our construction will exhibit three main advantages. First, our packet overhead will only be a few hashes long. Second, we作者: Thyroid-Gland 時(shí)間: 2025-3-27 03:48 作者: FACT 時(shí)間: 2025-3-27 07:40 作者: orthodox 時(shí)間: 2025-3-27 10:05
Presenting components on the web practical applications, it is crucial to provide efficient and secure implementations of the pairings. There have been several works on efficient implementations of the pairings. However, the research for secure implementations of the pairings has not been thoroughly investigated. In this paper, we作者: fatty-streak 時(shí)間: 2025-3-27 17:18
Baruch Awerbuch,David Holmer,Herbert Rubensoject. Wu Wenling presented the collision attack on reduced-round Camellia in 2004, the 128-bit key of 6 rounds Camellia can be recovered with 2. chosen plaintexts and 2. encryptions. The improved collision attack on 6 rounds Camellia which based on four 4-round distinguishers is presented in this p作者: fulcrum 時(shí)間: 2025-3-27 19:03 作者: arabesque 時(shí)間: 2025-3-28 01:43
Liang Song,Raviraj Adve,Dimitrios Hatzinakosance of the application, the speeds of encryption and decryption of the algorithm are critical. To obtain maximum performance from the algorithm, efficient techniques for its implementation must be used and the implementation must be tuned for the specific hardware on which it is running..Bitslice i作者: 肌肉 時(shí)間: 2025-3-28 06:09 作者: 平庸的人或物 時(shí)間: 2025-3-28 10:18 作者: BIAS 時(shí)間: 2025-3-28 13:17
Liang Song,Raviraj Adve,Dimitrios Hatzinakosng copyright signatures inside the program code or its runtime state. Prior proposals hide the watermarks in dummy data structures, e.g., linked lists and graphs that are created during the execution of the hosting software for this reason. This makes it vulnerable to subtractive attacks, because th作者: 表示向前 時(shí)間: 2025-3-28 14:43 作者: Chronic 時(shí)間: 2025-3-28 20:55 作者: paltry 時(shí)間: 2025-3-28 23:24 作者: monogamy 時(shí)間: 2025-3-29 05:19
Cryptology and Network Security978-3-540-49463-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: bioavailability 時(shí)間: 2025-3-29 08:33
0302-9743 Overview: 978-3-540-49462-1978-3-540-49463-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Accolade 時(shí)間: 2025-3-29 13:14 作者: 歡笑 時(shí)間: 2025-3-29 17:18
Hassan Ebrahimirad,M. J. Yazdanpanahdifference sets, we construct a perfect nonlinear function from . to . where 2. is possibly larger than the largest divisor of .. Meanwhile we prove that there exists a perfect nonlinear function from . to . if and only if .=2, and that there doesn’t exist a perfect nonlinear function from . to . if .>. and .(. is odd) is . modulo 2.(.≥1) .作者: PARA 時(shí)間: 2025-3-29 22:22 作者: boisterous 時(shí)間: 2025-3-30 03:04 作者: 玷污 時(shí)間: 2025-3-30 05:01
Watermarking Essential Data Structures for Copyright Protectiont on the operations and performance of the data structure..This paper proposes a novel method for watermarking R-tree data structure and its variants. The proposed watermarking scheme takes advantage of the redundancy in the way the entries within R-tree nodes are ordered. R-trees do not require ord作者: 不能和解 時(shí)間: 2025-3-30 10:48 作者: Synchronism 時(shí)間: 2025-3-30 14:45
Liang Song,Raviraj Adve,Dimitrios Hatzinakossional feature vector can be extracted from a JPEG image. Two blindly steganalytic algorithms were constructed based on Support Vector Machine and the two kinds of feature vectors respectively. The presented methods demonstrate higher detecting rates with lower false positives than known schemes.作者: dandruff 時(shí)間: 2025-3-30 19:30
Liang Song,Raviraj Adve,Dimitrios Hatzinakost on the operations and performance of the data structure..This paper proposes a novel method for watermarking R-tree data structure and its variants. The proposed watermarking scheme takes advantage of the redundancy in the way the entries within R-tree nodes are ordered. R-trees do not require ord作者: 摻假 時(shí)間: 2025-3-30 20:59
The Zope 3 Component Architecturel of security of HMQV. So far there are no authenticated Diffie-Hellman protocols which are proven secure in the standard model and achieve the same level of security goals of HMQV efficiently yet. Dispensing of random oracles in our protocol does not require any expensive signature and encryption schemes.作者: 朦朧 時(shí)間: 2025-3-31 02:15
Presenting components on the webivers, who do not need to update their state during the protocol execution. Using a public board, GC does not need to multicast any rekeying message when a user joins/leaves the communication group. Security analysis shows that LIH satisfies both backward secrecy and forward secrecy.作者: Lethargic 時(shí)間: 2025-3-31 07:01
A Diffie-Hellman Key Exchange Protocol Without Random Oraclesl of security of HMQV. So far there are no authenticated Diffie-Hellman protocols which are proven secure in the standard model and achieve the same level of security goals of HMQV efficiently yet. Dispensing of random oracles in our protocol does not require any expensive signature and encryption schemes.作者: lipoatrophy 時(shí)間: 2025-3-31 11:42
Authenticated Group Key Agreement for Multicastivers, who do not need to update their state during the protocol execution. Using a public board, GC does not need to multicast any rekeying message when a user joins/leaves the communication group. Security analysis shows that LIH satisfies both backward secrecy and forward secrecy.作者: Fretful 時(shí)間: 2025-3-31 16:20
Concrete Chosen-Ciphertext Secure Encryption from Subgroup Membership Problems derived schemes are more efficient than the previous schemes from this construction, including the Cramer-Shoup cryptosystem, when long messages are considered. The hybrid variants are even more efficient, with a smaller number of exponentiations and a shorter ciphertext than the Kurosawa-Desmedt Decisional Diffie-Hellman based scheme.作者: Anticonvulsants 時(shí)間: 2025-3-31 18:09
Security Model of Proxy-Multi Signature Schemese formal definition and a security model of proxy-multi signature scheme. We also constructed a proxy-multi signature scheme based on the BLS short signature scheme and proved its security in our security model.作者: ELUC 時(shí)間: 2025-3-31 21:49
Efficient ID-Based One-Time Proxy Signature and Its Application in E-Chequepresented. Therefore, in this paper, to fill this void, we first formalize the security notions for IBOTPS, and propose the first efficient IBOTPS scheme based on the bilinear pairings and provide the formal security proofs in the random oracle model. Also, we consider an application of the proposed scheme in E-cheque scenarios.作者: 阻擋 時(shí)間: 2025-4-1 05:48 作者: Adherent 時(shí)間: 2025-4-1 08:41
The Zope 3 Component Architecture previous articles by Vaudenay and Pasini the results of this paper are more general and based on weaker security assumptions. In addition to providing security proofs for our protocols, we focus also on implementation details and propose practically secure and efficient sub-primitives for applications.作者: Interstellar 時(shí)間: 2025-4-1 10:20
Authentication and user management will exhibit a number of signature verifications to be performed by the receivers which will turn to be .(1). Third, every receiver will still be able to recover all the data packets emitted by the sender despite losses and injections occurred during the transmission of information.作者: Lamina 時(shí)間: 2025-4-1 14:25
Presenting components on the web investigate vulnerability of the pairing used in some pairing based protocols against side channel attacks. We propose an efficient algorithm secure against such side channel attacks of the eta pairing using randomized projective coordinate systems for the pairing computation.作者: 假設(shè) 時(shí)間: 2025-4-1 22:12
Authentication and user managementced by Katz and Wang; however, unlike the Katz-Wang variant, our scheme is quite efficient, as its ciphertext size is roughly comparable to that of the original full Boneh-Franklin scheme. The security of our scheme can be based on either the gap bilinear Diffie-Hellman (GBDH) or the decisional bilinear Diffie-Hellman (DBDH) assumptions.作者: 偽善 時(shí)間: 2025-4-2 02:41 作者: 軍火 時(shí)間: 2025-4-2 03:32
Liang Song,Raviraj Adve,Dimitrios Hatzinakoss is much harder than in the case of classical subliminal channels..The problems are caused by certain design features of SSL/TLS and SSH protocols that make them vulnerable for a kleptographic attack. We propose changes of these protocols that make them immune against this threat while all previous security features remain preserved.作者: Champion 時(shí)間: 2025-4-2 10:53
