標(biāo)題: Titlebook: Cryptology and Network Security; 12th International C Michel Abdalla,Cristina Nita-Rotaru,Ricardo Dahab Conference proceedings 2013 Springe [打印本頁] 作者: Washington 時間: 2025-3-21 16:05
書目名稱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é)科排名
作者: 染色體 時間: 2025-3-21 23:05
0302-9743 ternational Conference on Cryptology and Network Security, CANS 2013, held in Paraty, Brazil, in November 2013..The 18 revised full papers presented together with four invited talks were carefully reviewed and selected from 57 submissions. The papers are organized in topical sections on cryptanalysi作者: 不妥協(xié) 時間: 2025-3-22 01:14
Workflow-based Integration (WfbI),ents that can align the current implementation with all its intended security properties. To the best of our knowledge this is the first time that a security analysis of the Facebook resource access control mechanism is performed within a proper security model.作者: RAG 時間: 2025-3-22 04:54 作者: 預(yù)防注射 時間: 2025-3-22 12:02 作者: 放逐 時間: 2025-3-22 16:19 作者: 放逐 時間: 2025-3-22 17:39 作者: wreathe 時間: 2025-3-22 21:23 作者: assent 時間: 2025-3-23 04:06
Enterprise Application Integration (EAI),r. We construct VC schemes with input privacy for univariate polynomial evaluation and matrix multiplication and then extend them to achieve function privacy. Our main tool is the recently proposed .. We show that the proposed VC schemes can be used to implement verifiable outsourcing of private information retrieval (PIR).作者: 倔強(qiáng)一點(diǎn) 時間: 2025-3-23 08:53
Differential Attacks on Generalized Feistel SchemesHAvite???3..In this paper, we give our best Known Plaintext Attacks and non-adaptive Chosen Plaintext Attacks on these schemes. We determine the maximal number of rounds that we can attack when we want to distinguish a permutation produced by the scheme from a permutation chosen randomly in the set of permutations.作者: lavish 時間: 2025-3-23 12:38
A Practical Related-Key Boomerang Attack for the Full MMB Block Ciphere full MMB key..After showing this practical attack on the full key of the full MMB, we present attacks on extended versions of MMB with up to 8 rounds (which is two more rounds than in the full MMB). We recover 64 out of the 128 key in time of 2. for 7-round MMB, and time of 2. for 8-round MMB using 2. plaintexts.作者: Ambulatory 時間: 2025-3-23 14:23
Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Mapsr. We construct VC schemes with input privacy for univariate polynomial evaluation and matrix multiplication and then extend them to achieve function privacy. Our main tool is the recently proposed .. We show that the proposed VC schemes can be used to implement verifiable outsourcing of private information retrieval (PIR).作者: Lice692 時間: 2025-3-23 18:22 作者: 描繪 時間: 2025-3-24 01:17 作者: Conducive 時間: 2025-3-24 05:39 作者: 躲債 時間: 2025-3-24 08:12
Conference proceedings 2013. The papers are organized in topical sections on cryptanalysis, zero-knowledge protocols, distributed protocols, network security and applications, advanced cryptographic primitives, and verifiable computation..作者: 飛行員 時間: 2025-3-24 11:50
Enterprise Application Integration (EAI), existence of a commitment scheme. We will see that our scheme works with any non-abelian groups with a set of authorized moves that has a specific property. Then we will generalize the scheme for larger Rubik’s cubes and for any groups.作者: 表否定 時間: 2025-3-24 18:11 作者: Vertical 時間: 2025-3-24 22:23
Michel Abdalla,Cristina Nita-Rotaru,Ricardo DahabUp to date results.Fast track conference proceedings.State of the art research作者: 騷擾 時間: 2025-3-25 00:04 作者: 胰臟 時間: 2025-3-25 06:00
Efficient Modular NIZK Arguments from Shift and Producto design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover’s computation. We construct NIZK arguments for .-complete languages, ., . and ., with constant communication, subquadratic prover’s computation and linear verifier’s computation.作者: 滑稽 時間: 2025-3-25 07:35
How to Update Documents , in Searchable Symmetric Encryptionpted documents which contain a specific keyword, keeping the keyword and the documents secret. In this paper, we show how to update (modify, delete and add) documents in a . way. Namely the client can detect any cheating behavior of malicious servers. We then prove that our scheme is UC-secure in the standard model.作者: engagement 時間: 2025-3-25 11:53 作者: 財產(chǎn) 時間: 2025-3-25 16:16
Workflow-based Integration (WfbI),o design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover’s computation. We construct NIZK arguments for .-complete languages, ., . and ., with constant communication, subquadratic prover’s computation and linear verifier’s computation.作者: CHOIR 時間: 2025-3-25 20:04
Enterprise Application Integration (EAI),pted documents which contain a specific keyword, keeping the keyword and the documents secret. In this paper, we show how to update (modify, delete and add) documents in a . way. Namely the client can detect any cheating behavior of malicious servers. We then prove that our scheme is UC-secure in the standard model.作者: aqueduct 時間: 2025-3-26 00:39
https://doi.org/10.1007/978-3-319-02937-5access control; ciphers; mobile devices; oracle attack; symmetric encryption作者: Excitotoxin 時間: 2025-3-26 05:23
978-3-319-02936-8Springer International Publishing Switzerland 2013作者: 不斷的變動 時間: 2025-3-26 10:01 作者: Mercantile 時間: 2025-3-26 16:11
Workflow-based Integration (WfbI),sec. We demonstrate that to construct successful forgeries of GCM-like polynomial-based MAC schemes, hash collisions are not necessarily required and any polynomials could be used in the attacks, which removes the restrictions of attacks previously proposed by Procter and Cid. Based on these new dis作者: 綠州 時間: 2025-3-26 17:35
Enterprise Application Integration (EAI),m, PKCS#1 v1.5 is still widely deployed in various real-life applications. Among these applications, it is not hard to find that some implementations do not follow PKCS#1 v1.5 step-by-step. Some of these non-standard implementations provide different padding oracles, which causes standard POA to fai作者: HAUNT 時間: 2025-3-26 23:54 作者: glowing 時間: 2025-3-27 04:55
Enterprise Application Integration (EAI), of the Rubik’s cube. We will define a public key identification scheme based on this problem, in the case of the Rubik’s cube, when the number of moves is fixed to a given value. Our scheme consists of an interactive protocol which is zero-knowledge argument of knowledge under the assumption of the作者: 描繪 時間: 2025-3-27 08:49
Workflow-based Integration (WfbI),o design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover’s computation. We construct NIZK arguments for .-complete languages, ., . and ., with constant communication, subquadratic prover’s computation 作者: 暫時中止 時間: 2025-3-27 10:50
Workflow-based Integration (WfbI), case of GAKE – the pairing-based one-round tripartite authenticated key exchange (3AKE), recently gains much attention of research community due to its strong security. Several pairing-based one-round 3AKE protocols have recently been proposed to achieve provable security in the g-eCK model. In con作者: frozen-shoulder 時間: 2025-3-27 14:55
Enterprise Application Integration (EAI),.e. a fair outcome). Prior rational secret reconstruction protocols for non-simultaneous channel only address the case where a fair outcome is preferred over misleading and hence are fair but not correct. Asharov and Lindell (2010) proposed the first and the only protocol that takes care of both the作者: initiate 時間: 2025-3-27 18:47 作者: 鑲嵌細(xì)工 時間: 2025-3-28 00:55
Workflow-based Integration (WfbI),hich treats the server as a trusted party, suggests two fundamental properties, “owner privacy” and “server consistency”, and two different modes of revocation, implicit and explicit. Through black-box experimentation, we determine Facebook’s implementation for resource access control and we analyze作者: 尖叫 時間: 2025-3-28 04:04
Workflow-based Integration (WfbI),ments) are highly sensitive and can be abused by malicious entities, without the knowledge of the device user, in the form of insider attacks (such as malware) and/or outsider attacks (such as unauthorized reading and relay attacks)..In this paper, we present a novel application permission granting 作者: NICHE 時間: 2025-3-28 08:36
Workflow-based Integration (WfbI),ing selective opening attacks (SOA-K). This connection helps intuitively explain their impossibility results and also allows us to prove stronger ones. To fill this gap and move us closer to the (laudable) goal of a general and achievable notion of FE security, we seek and provide two “sans SOA-K” d作者: 講個故事逗他 時間: 2025-3-28 13:48 作者: Charitable 時間: 2025-3-28 17:33 作者: plasma 時間: 2025-3-28 20:31
Workflow-based Integration (WfbI),te. LLR statistical test is used as a tool to apply the distinguishing and key-recovery attacks. To build the distinguisher, all possible differences are traced through the cipher and the truncated differential probability distribution is determined for every output nibble. We concatenate additional作者: 發(fā)酵 時間: 2025-3-28 23:24 作者: separate 時間: 2025-3-29 07:04 作者: 偽善 時間: 2025-3-29 08:39 作者: Pantry 時間: 2025-3-29 13:32 作者: NAV 時間: 2025-3-29 18:58 作者: Factual 時間: 2025-3-29 21:58 作者: jovial 時間: 2025-3-30 01:20 作者: olfction 時間: 2025-3-30 06:29
Efficient Modular NIZK Arguments from Shift and Producto design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover’s computation. We construct NIZK arguments for .-complete languages, ., . and ., with constant communication, subquadratic prover’s computation 作者: Offstage 時間: 2025-3-30 12:11
Strongly Secure One-Round Group Authenticated Key Exchange in the Standard Model case of GAKE – the pairing-based one-round tripartite authenticated key exchange (3AKE), recently gains much attention of research community due to its strong security. Several pairing-based one-round 3AKE protocols have recently been proposed to achieve provable security in the g-eCK model. In con作者: JEER 時間: 2025-3-30 15:06
Achieving Correctness in Fair Rational Secret Sharing.e. a fair outcome). Prior rational secret reconstruction protocols for non-simultaneous channel only address the case where a fair outcome is preferred over misleading and hence are fair but not correct. Asharov and Lindell (2010) proposed the first and the only protocol that takes care of both the作者: 討厭 時間: 2025-3-30 18:16
BotSuer: Suing Stealthy P2P Bots in Network Traffic through Netflow Analysis topologies provide a better resilience against detection and takedown as they avoid single nodes of failure in the botnet architecture. Yet current state of the art techniques to detect P2P bots mostly rely on swarm effects. They detect bots only when there is multiple infected nodes belonging to t作者: 幾何學(xué)家 時間: 2025-3-30 22:46
Resource Access Control in the Facebook Modelhich treats the server as a trusted party, suggests two fundamental properties, “owner privacy” and “server consistency”, and two different modes of revocation, implicit and explicit. Through black-box experimentation, we determine Facebook’s implementation for resource access control and we analyze作者: Anterior 時間: 2025-3-31 04:55 作者: 遵循的規(guī)范 時間: 2025-3-31 07:16
Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest ing selective opening attacks (SOA-K). This connection helps intuitively explain their impossibility results and also allows us to prove stronger ones. To fill this gap and move us closer to the (laudable) goal of a general and achievable notion of FE security, we seek and provide two “sans SOA-K” d作者: Obscure 時間: 2025-3-31 11:04
Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functionservers, and results in a publicly verifiable pseudorandom output to the user. Previous DVRF constructions assumed trusted generation of secret keys for the servers and imposed a threshold on the number of corrupted servers..In this paper we propose the first generic approach for building DVRFs, unde作者: Moderate 時間: 2025-3-31 17:17 作者: LAP 時間: 2025-3-31 20:04
Truncated Differential Analysis of Reduced-Round LBlockte. LLR statistical test is used as a tool to apply the distinguishing and key-recovery attacks. To build the distinguisher, all possible differences are traced through the cipher and the truncated differential probability distribution is determined for every output nibble. We concatenate additional作者: interior 時間: 2025-4-1 00:36
How to Update Documents , in Searchable Symmetric Encryptionpted documents which contain a specific keyword, keeping the keyword and the documents secret. In this paper, we show how to update (modify, delete and add) documents in a . way. Namely the client can detect any cheating behavior of malicious servers. We then prove that our scheme is UC-secure in th
