標(biāo)題: Titlebook: Cryptology and Network Security; 13th International C Dimitris Gritzalis,Aggelos Kiayias,Ioannis Askoxyl Conference proceedings 2014 Spring [打印本頁] 作者: energy 時(shí)間: 2025-3-21 19:35
書目名稱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é)科排名
作者: 迎合 時(shí)間: 2025-3-22 00:00
Proxy Re-encryption with Unforgeable Re-encryption Keys,ryption keys for a semi-trusted proxy, with which the proxy can translate a ciphertext intended for Alice into a ciphertext for the delegatee Bob of the same plaintext. Existing PRE schemes have considered the security that the collusion attacks among the proxy and the delegatees cannot expose the d作者: 護(hù)身符 時(shí)間: 2025-3-22 01:54 作者: 反省 時(shí)間: 2025-3-22 06:23 作者: 蝕刻 時(shí)間: 2025-3-22 10:08 作者: 憤憤不平 時(shí)間: 2025-3-22 13:26
Message Extension Attack against Authenticated Encryptions: Application to PANDA,ension attack against hash function based MACs. The approach is called message extension attack. The target class is the schemes that initialize the internal state with nonce and key, update the state by associated data and message, extract key stream from the state, and finally generate a tag from 作者: 憤憤不平 時(shí)間: 2025-3-22 17:25 作者: 高談闊論 時(shí)間: 2025-3-23 01:13
Negotiating DNSSEC Algorithms over Legacy Proxies,rted by the different parties; this is usually referred to as ., and considered an essential feature of such protocols, e.g., TLS and IPsec. However, such negotiation is absent from protocols designed for . of cryptographically-signed objects, such as DNSSEC. One reason may be the challenges of secu作者: 向下 時(shí)間: 2025-3-23 04:40 作者: Pudendal-Nerve 時(shí)間: 2025-3-23 08:55 作者: 大火 時(shí)間: 2025-3-23 13:45
Converting PKI-Based Authenticated Key Exchange to Identity-Based, communication and computation, the scheme is not secure against some advanced exposure attacks. In this paper, we achieve exposure-resilient ID-AKE schemes without pairings. Specifically, we introduce two . generic conversions from ordinary PKI-based AKE (PKI-AKE) to ID-AKE (i.e., exposure resilien作者: 色情 時(shí)間: 2025-3-23 17:24
Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi a semi-honest sender. To achieve this we are the first to combine a machine-assisted proof of correctness with advanced cryptographic primitives to prove security properties of Java code. The machine-assisted part of the proof is conducted with KeY, an interactive theorem prover..The proof includes作者: convulsion 時(shí)間: 2025-3-23 19:12 作者: scotoma 時(shí)間: 2025-3-24 01:31 作者: 邊緣帶來墨水 時(shí)間: 2025-3-24 03:47
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers,private information retrieval schemes can be built using locally decodable codes [15]. In this paper, we construct a Byzantine robust PIR scheme using the multiplicity codes introduced by Kopparty . [12]. Our main contributions are on the one hand to avoid full replication of the database on each se作者: 拍翅 時(shí)間: 2025-3-24 07:00 作者: WITH 時(shí)間: 2025-3-24 11:37 作者: Antagonist 時(shí)間: 2025-3-24 18:13 作者: 向下 時(shí)間: 2025-3-24 22:36 作者: flourish 時(shí)間: 2025-3-25 02:32
Cryptology and Network Security978-3-319-12280-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: orthodox 時(shí)間: 2025-3-25 04:36
,Edward Hallaran Bennett 1837–1907,che at CHES/CRYPTO 2010). At CRYPTO 2013, Gentry, Sahai and Waters largely settled the problem by presenting leveled IBFHE constructions based on the Learning With Errors problem. However their constructions are not bootstrappable, and as a result, are not “pure” IBFHE schemes. The major challenge w作者: enlist 時(shí)間: 2025-3-25 10:49 作者: 易碎 時(shí)間: 2025-3-25 15:32
,David McCrae Aitken 1876–1954, we investigate the lossiness of 2.-th power based on the 2.-Φ/4-hiding assumption, which is an extension of the 2-Φ/4-hiding assumption. And we prove that 2.-th power function is a lossy trapdoor permutation over Quadratic Residuosity group. This new lossy trapdoor function has 2.-bits lossiness fo作者: MONY 時(shí)間: 2025-3-25 15:54 作者: 沉思的魚 時(shí)間: 2025-3-25 23:10 作者: 額外的事 時(shí)間: 2025-3-26 03:59 作者: 詼諧 時(shí)間: 2025-3-26 05:08
,William Morant Baker 1839–1896,ated hash function is used. In the first variant of the attack, the adversary is able to choose the initial value of the hash function after receiving the original message. In the second variant, the adversary is allowed to determine a prefix of the original message and has to create a second preima作者: macular-edema 時(shí)間: 2025-3-26 11:49 作者: AVID 時(shí)間: 2025-3-26 13:48
,William Morant Baker 1839–1896,cess to information. This paper introduces the design and implementation of the GNU Name System (GNS), a fully decentralized and censorship-resistant name system. GNS provides a privacy-enhancing alternative to DNS which preserves the desirable property of memorable names. Due to its design, it can 作者: 有斑點(diǎn) 時(shí)間: 2025-3-26 16:51 作者: stress-test 時(shí)間: 2025-3-26 23:57 作者: Allure 時(shí)間: 2025-3-27 02:53 作者: 徹底檢查 時(shí)間: 2025-3-27 08:02
,Alfred Washington Adson 1887–1951,y is making Android an enticing target for malwares. A worrying trend that is alarming is the increasing sophistication of Android malware to evade detection by traditional signature based scanners. Several approaches have been proposed in literature for Android malware detection. However, most of t作者: Trypsin 時(shí)間: 2025-3-27 10:00
,Alfred Washington Adson 1887–1951,imitive is a Direct Anonymous Attestation in which the anonymity can be revoked only if a specific authority, called the admitter, allowed to revoke the DAA signatures that include a specific basename. We also present an efficient scheme that achieves this functionality, secure in the random oracle 作者: 慷慨不好 時(shí)間: 2025-3-27 16:45
,Fred Houdlette Albee 1876–1945,private information retrieval schemes can be built using locally decodable codes [15]. In this paper, we construct a Byzantine robust PIR scheme using the multiplicity codes introduced by Kopparty . [12]. Our main contributions are on the one hand to avoid full replication of the database on each se作者: 閑聊 時(shí)間: 2025-3-27 21:11
,William Morant Baker 1839–1896,such parties to try to obtain the secret while spending as little as possible on communication and computation. This preference is different from a traditional rational player and is similar to .. We call such players .. The traditional rational player is represented as a . player and we modify its 作者: Munificent 時(shí)間: 2025-3-27 22:14
,Marie Francois Xavier Bichat 1771–1802,edentials/attributes to anonymously sign a message w.r.t. some public policy revealing neither the attributes used nor his identity. User-controlled linkability is a new feature which allows a user to make some of his signatures directed at the same recipient linkable while still retaining anonymity作者: 精美食品 時(shí)間: 2025-3-28 02:59
,Alfred Washington Adson 1887–1951,t cards are an attractive container for such credentials, for security and privacy reasons. But their limited processing power and random access storage capacity pose a severe challenge. Recently, we, the IRMA team, managed to fully implement a limited subset of the Idemix ABC system on a smart card作者: 身體萌芽 時(shí)間: 2025-3-28 07:21 作者: Circumscribe 時(shí)間: 2025-3-28 12:39 作者: flamboyant 時(shí)間: 2025-3-28 18:07 作者: sorbitol 時(shí)間: 2025-3-28 20:27
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/240601.jpg作者: harbinger 時(shí)間: 2025-3-29 01:33
Bootstrappable Identity-Based Fully Homomorphic Encryption,-based setting. Our attribute-based scheme is the first to support homomorphic evaluation on ciphertexts with different attributes. Finally, we characterize presently-known leveled IBFHE schemes with a view to developing a “compiler” from a leveled IBFHE scheme to a bootstrappable IBFHE scheme, and 作者: abnegate 時(shí)間: 2025-3-29 05:17
FFT Key Recovery for Integral Attack,ks against ., CLEFIA, and AES. As a result, 8-round .. can be attacked with about an approximate time complexity of 2.. Moreover, a 6-round AES and 12-round CLEFIA can be attacked with approximate time complexities of 2. and 2., respectively.作者: 斜谷 時(shí)間: 2025-3-29 09:57
Negotiating DNSSEC Algorithms over Legacy Proxies,also larger than alternatives; the likely reason is lack of negotiation mechanisms. We present a ., allowing name-servers to send responses containing only the keys and signatures required by the requesting resolver. Our design is compatible with intermediary proxies, and even with legacy proxies, t作者: Texture 時(shí)間: 2025-3-29 15:00
A Censorship-Resistant, Privacy-Enhancing and Fully Decentralized Name System,nd memorable mapping without a trusted authority. GNS uses the transitivity in the SDSI design to replace the trusted root with secure delegation of authority, thus making petnames useful to other users while operating under a very strong adversary model. In addition to describing the GNS design, we作者: bacteria 時(shí)間: 2025-3-29 15:38
Converting PKI-Based Authenticated Key Exchange to Identity-Based,t can be instantiated from various kinds of number-theoretic assumptions such as RSA and lattices as well as Diffie-Hellman variants) thanks to rich instantiability of known PKI-AKE schemes in the pre-specified peer model.作者: AFFIX 時(shí)間: 2025-3-29 20:51
Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi an honest receiver, we use the framework presented by Küsters et al.?for the cryptographic verification of Java programs. As part of our work, we add oblivious transfer to the set of cryptographic primitives supported by the framework. This is a general contribution beyond our results for concrete 作者: nitroglycerin 時(shí)間: 2025-3-30 02:54
Mining API Calls and Permissions for Android Malware Detection,ng Naive Bayesian as well as K-Nearest Neighbour classifiers. Proposed models are able to detect real malwares in the wild and achieve an accuracy of 95.1% and true positive rate with highest value one.作者: temperate 時(shí)間: 2025-3-30 05:35 作者: 卡死偷電 時(shí)間: 2025-3-30 11:59 作者: 破裂 時(shí)間: 2025-3-30 13:39 作者: insolence 時(shí)間: 2025-3-30 19:58 作者: 戲法 時(shí)間: 2025-3-30 20:41
,Edward Hallaran Bennett 1837–1907,also larger than alternatives; the likely reason is lack of negotiation mechanisms. We present a ., allowing name-servers to send responses containing only the keys and signatures required by the requesting resolver. Our design is compatible with intermediary proxies, and even with legacy proxies, t作者: 憤怒事實(shí) 時(shí)間: 2025-3-31 02:38 作者: TERRA 時(shí)間: 2025-3-31 07:50 作者: 遺留之物 時(shí)間: 2025-3-31 12:36
,Fred Houdlette Albee 1876–1945, an honest receiver, we use the framework presented by Küsters et al.?for the cryptographic verification of Java programs. As part of our work, we add oblivious transfer to the set of cryptographic primitives supported by the framework. This is a general contribution beyond our results for concrete 作者: 開始從未 時(shí)間: 2025-3-31 15:46 作者: breadth 時(shí)間: 2025-3-31 18:56 作者: cocoon 時(shí)間: 2025-4-1 01:03
,Alfred Washington Adson 1887–1951,fication and secure messaging. In contrast to prior work that only addressed the verification of one credential with only one attribute (particularly, the master secret), we can now perform multi-credential proofs on credentials of 5 attributes and complex proofs in reasonable time. We provide a det作者: Scleroderma 時(shí)間: 2025-4-1 03:55 作者: Assignment 時(shí)間: 2025-4-1 07:40
,Christopher George Attenborough 1922–1979,analyze Cryptophia’s combiner and show that a collision can be found in two queries and a second preimage in one query, invalidating the claimed results. We additionally propose a way to fix the design in order to re-establish the original security results.作者: 撫育 時(shí)間: 2025-4-1 11:31
,William Morant Baker 1839–1896,of them successfully is in . while on random oracle hash function it is in .. We also show that it is possible to decrease the before mentioned expected value to . if the length of the original message is 2. and . is sufficiently large. Furthermore, we generalize these attacks to work against concatenated hash functions as well.作者: 性上癮 時(shí)間: 2025-4-1 17:05 作者: 用不完 時(shí)間: 2025-4-1 22:29 作者: Estrogen 時(shí)間: 2025-4-2 00:02
