標(biāo)題: Titlebook: Applied Cryptography and Network Security; 8th International Co Jianying Zhou,Moti Yung Conference proceedings 2010 Springer-Verlag Berlin [打印本頁] 作者: 削木頭 時間: 2025-3-21 16:28
書目名稱Applied Cryptography and Network Security影響因子(影響力)
書目名稱Applied Cryptography and Network Security影響因子(影響力)學(xué)科排名
書目名稱Applied Cryptography and Network Security網(wǎng)絡(luò)公開度
書目名稱Applied Cryptography and Network Security網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Applied Cryptography and Network Security被引頻次
書目名稱Applied Cryptography and Network Security被引頻次學(xué)科排名
書目名稱Applied Cryptography and Network Security年度引用
書目名稱Applied Cryptography and Network Security年度引用學(xué)科排名
書目名稱Applied Cryptography and Network Security讀者反饋
書目名稱Applied Cryptography and Network Security讀者反饋學(xué)科排名
作者: municipality 時間: 2025-3-21 20:57 作者: 暴露他抗議 時間: 2025-3-22 02:14
Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions about Θ(..) group elements for a reduction from the decisional Diffie-Hellman assumption (where . is a security parameter). We propose two realizations of lossy trapdoor functions that achieve public key size of only Θ(.) group elements in bilinear groups, with a reduction from the decisional Bilin作者: Diskectomy 時間: 2025-3-22 05:23
Trapdoor Sanitizable Signatures Made Easyge is signed, the sanitizer can modify pre-determined parts of the message and generate a new signature on the sanitized message without interacting with the signer. At ACNS?2008, Canard et al. introduced trapdoor sanitizable signatures based on identity-based chameleon hashes, where the power of sa作者: acrobat 時間: 2025-3-22 11:55 作者: incredulity 時間: 2025-3-22 14:27
Redactable Signatures for Tree-Structured Data: Definitions and Constructionsty distributors) while pertaining the integrity of the remaining parts. An example is given by signed XML documents of which parts should be sanitized before being published by a distributor not holding the signing key. Kundu and Bertino also provide a construction, but fall short of providing forma作者: 散布 時間: 2025-3-22 19:10 作者: dapper 時間: 2025-3-22 23:11 作者: Cabinet 時間: 2025-3-23 01:39 作者: CLAIM 時間: 2025-3-23 09:23
High Performance GHASH Function for Long Messages bit string made of . blocks of 128 bits each, then the GHASH function effectively computes ., where . is an element of the binary field .. This operation is usually computed by using . successive multiply-add operations over .. In this work, we propose a method to replace all but a fixed number of 作者: G-spot 時間: 2025-3-23 13:16
Principles on the Security of AES against First and Second-Order Differential Power Analysisis a powerful technique used to attack a cryptographic implementation in a resource-limited application environment like smartcards. Despite the extensive research on DPA of AES, it seems none has explicitly addressed the fundamental issue: How many rounds of the beginning and end parts of an AES im作者: 樂章 時間: 2025-3-23 15:13
Adaptive Chosen-Message Side-Channel Attackslyze the increase of the attacks’ efficiencies that can be obtained by adaptively selecting the messages. For this purpose, we first describe a generic strategy that allows an adversary to take advantage of this capability. We show that it can be applied to any differential power or electromagnetic 作者: 使高興 時間: 2025-3-23 19:26 作者: 平躺 時間: 2025-3-23 23:53
Batch Groth–Sahainear groups. While avoiding expensive NP-reductions, these proof systems are still inefficient due to the number of pairing computations required for verification. We apply recent techniques of . to the Groth-Sahai proof systems and succeed to improve significantly the complexity of proof verificati作者: Insensate 時間: 2025-3-24 04:28 作者: VALID 時間: 2025-3-24 10:06 作者: Eviction 時間: 2025-3-24 12:20
Improving the Round Complexity of Traitor Tracing Schemes process that can interact with any adversarial decoder and reveal the identities of the users whose keys are employed by the decoder. A number of desired design goals have been put forth for traitor tracing schemes, notably the minimization of the length of the ciphertexts, the length of the encryp作者: Emg827 時間: 2025-3-24 18:08
Password Based Key Exchange Protocols on Elliptic Curves Which Conceal the Public Parametersre-Pointcheval-Rogaway (BPR) model. A significant novelty in our work is that the elliptic curve public parameters remain private. This is important in the context of ID contactless devices as, in this case, there will exist most probably a way to link these parameters with the nationality of the ID作者: 落葉劑 時間: 2025-3-24 20:05 作者: septicemia 時間: 2025-3-25 01:59
Password Based Key Exchange Protocols on Elliptic Curves Which Conceal the Public Parametersre-Pointcheval-Rogaway (BPR) model. A significant novelty in our work is that the elliptic curve public parameters remain private. This is important in the context of ID contactless devices as, in this case, there will exist most probably a way to link these parameters with the nationality of the ID document owners.作者: 影響帶來 時間: 2025-3-25 03:20 作者: cunning 時間: 2025-3-25 09:39
Yogendra Shastri Ph.D.,K. C. Ting Ph.D. .???[1, .] freely and encrypt a message for the recipients in . such that only those receivers can open the message. The transmission overload of most previous broadcast encryption systems grows in line with the number of revoked users . and thus they are suitable for the scenario where the target 作者: 敵手 時間: 2025-3-25 14:19
https://doi.org/10.1007/978-3-030-79614-3 about Θ(..) group elements for a reduction from the decisional Diffie-Hellman assumption (where . is a security parameter). We propose two realizations of lossy trapdoor functions that achieve public key size of only Θ(.) group elements in bilinear groups, with a reduction from the decisional Bilin作者: 使殘廢 時間: 2025-3-25 17:04 作者: 確認(rèn) 時間: 2025-3-25 20:39
Graph and Network Toolbox: Metanetaining public signature verifiability. With our work, we propose two generic constructions based on Merkle authentication trees that do not require non-interactive zero-knowledge proofs (NIZKs) for maintaining verifiability. Both are stateful and secure in the standard model. Furthermore, we extend 作者: 無思維能力 時間: 2025-3-26 03:00
https://doi.org/10.1007/978-1-4612-1584-4ty distributors) while pertaining the integrity of the remaining parts. An example is given by signed XML documents of which parts should be sanitized before being published by a distributor not holding the signing key. Kundu and Bertino also provide a construction, but fall short of providing forma作者: 相符 時間: 2025-3-26 06:29 作者: compassion 時間: 2025-3-26 11:27
Graph and Network Toolbox: Metanetxtensions. First, we investigate the existence of better trails than the one used in the former attack. For this purpose, we provide a theoretical evaluation of the trail distributions using probability transition matrices. Since the exhaustive evaluation of all possible distributions turned out to 作者: 激怒某人 時間: 2025-3-26 15:12 作者: Dendritic-Cells 時間: 2025-3-26 18:14 作者: 金桌活畫面 時間: 2025-3-26 22:21 作者: gonioscopy 時間: 2025-3-27 04:57 作者: Allodynia 時間: 2025-3-27 08:36 作者: 會議 時間: 2025-3-27 11:44 作者: 歡樂東方 時間: 2025-3-27 16:58
https://doi.org/10.1007/978-3-031-79952-5ho may corrupt all but one of the parties. Our protocols are round and communication efficient, and use the underlying cryptographic primitives in a black-box way. Our construction achieves optimal communication complexity for degree 2 and 3 polynomials..Our constructions can be used to securely and作者: 丑惡 時間: 2025-3-27 21:12 作者: 軟弱 時間: 2025-3-28 01:22
Caroline Baillie,George Catalano process that can interact with any adversarial decoder and reveal the identities of the users whose keys are employed by the decoder. A number of desired design goals have been put forth for traitor tracing schemes, notably the minimization of the length of the ciphertexts, the length of the encryp作者: 帶來 時間: 2025-3-28 02:20
Juan Lucena,Jon A. Leydens,Samantha Templere-Pointcheval-Rogaway (BPR) model. A significant novelty in our work is that the elliptic curve public parameters remain private. This is important in the context of ID contactless devices as, in this case, there will exist most probably a way to link these parameters with the nationality of the ID作者: shrill 時間: 2025-3-28 06:36
Juan Lucena,Jen Schneider,Jon A. Leydensl (DHP) (. messages with a . group element per message), and similar low computational overhead, can achieve forward secrecy against active attackers in a . way. We answer this question in the affirmative by resorting to an old and elegant key agreement protocol: the Okamoto-Tanaka protocol?[22]. We作者: Hallowed 時間: 2025-3-28 14:15 作者: Spangle 時間: 2025-3-28 17:10
Juan Lucena,Jon A. Leydens,Samantha Templere-Pointcheval-Rogaway (BPR) model. A significant novelty in our work is that the elliptic curve public parameters remain private. This is important in the context of ID contactless devices as, in this case, there will exist most probably a way to link these parameters with the nationality of the ID document owners.作者: 腐爛 時間: 2025-3-28 20:49
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159737.jpg作者: 艱苦地移動 時間: 2025-3-29 00:49
https://doi.org/10.1007/978-3-642-13708-2AES; RFID; RSA; algorithms; authentication; calculus; complexity; cryptanalysis; cryptography; hash function; 作者: 揭穿真相 時間: 2025-3-29 05:32
978-3-642-13707-5Springer-Verlag Berlin Heidelberg 2010作者: 輕率看法 時間: 2025-3-29 09:11
0302-9743 0. ACNS 2010 brought together individuals from academia and industry involved in m- tiple research disciplines of cryptography and security to foster the exchange of ideas. ACNS was initiated in 2003, and there has been a steady improvement in the quality of its program over the past 8 years: ACNS 2作者: 桉樹 時間: 2025-3-29 15:04
Simulation and Optimization Tools simple 13-round multiset distinguisher with complexity of 2. steps. We show full key recovery chosen IV resynchronization attacks for up to 18 out of 33 initialization rounds of SNOW3G. with a complexity of 2. to generate the data and 2. steps of analysis.作者: flourish 時間: 2025-3-29 16:30
Caroline Baillie,George Catalanoles a number of multiparty computation where one or more of the parties only trust himself. Examples includes auctions, negotiations, and online gaming. The efficiency of the implementation is largely obtained through an efficient implementation of the Paillier cryptosystem, also described in this paper.作者: FECK 時間: 2025-3-29 23:36
Multiset Collision Attacks on Reduced-Round SNOW 3G and SNOW 3G?⊕ simple 13-round multiset distinguisher with complexity of 2. steps. We show full key recovery chosen IV resynchronization attacks for up to 18 out of 33 initialization rounds of SNOW3G. with a complexity of 2. to generate the data and 2. steps of analysis.作者: invulnerable 時間: 2025-3-30 01:06
Efficient Implementation of the Orlandi Protocolles a number of multiparty computation where one or more of the parties only trust himself. Examples includes auctions, negotiations, and online gaming. The efficiency of the implementation is largely obtained through an efficient implementation of the Paillier cryptosystem, also described in this paper.作者: BIPED 時間: 2025-3-30 06:03
Pak Sui Lam Ph.D.,Shahab Sokhansanj Ph.D.hich of two chosen plaintexts corresponds to a challenge ciphertext. The attack’s success odds are very high..The two new attacks rely on different mathematical tools and underline the need to accelerate the phase out of .#1 v1.5.作者: 發(fā)源 時間: 2025-3-30 11:15
https://doi.org/10.1007/978-1-4612-1584-4l security definitions and proofs. Here we revisit their work and give rigorous security models for the redactable signatures for tree-structured data, relate the notions, and give a construction that can be proven secure under standard cryptographic assumptions.作者: 合并 時間: 2025-3-30 12:57 作者: 預(yù)感 時間: 2025-3-30 18:49
Globalisation, Development, and Technology,analysis attack, against unprotected or protected devices and exploiting profiled or non-profiled leakage models. Then, we provide various experiments to quantify these improvements. Finally, we discuss the optimality of our strategy and its implications for the security evaluation of leakage-resilient cryptographic hardware.作者: Confound 時間: 2025-3-30 21:48
https://doi.org/10.1007/978-3-031-79952-5on. We give explicit batch-verification formulas for generic Groth-Sahai equations (whose cost is less than a tenth of the original) as well as for specific popular protocols relying on their methodology (namely Groth’s group signatures and the P-signatures by Belenkiy, Chase, Kohlweiss and Lysyanskaya).作者: 確定的事 時間: 2025-3-31 01:59 作者: regale 時間: 2025-3-31 07:56 作者: 摘要記錄 時間: 2025-3-31 10:04 作者: Isometric 時間: 2025-3-31 16:44 作者: 寬度 時間: 2025-3-31 18:50
