標(biāo)題: Titlebook: Cryptography and Coding; 16th IMA Internation Máire O‘Neill Conference proceedings 2017 Springer International Publishing AG 2017 Authentic [打印本頁] 作者: MAXIM 時(shí)間: 2025-3-21 16:04
書目名稱Cryptography and Coding影響因子(影響力)
書目名稱Cryptography and Coding影響因子(影響力)學(xué)科排名
書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度
書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Cryptography and Coding被引頻次
書目名稱Cryptography and Coding被引頻次學(xué)科排名
書目名稱Cryptography and Coding年度引用
書目名稱Cryptography and Coding年度引用學(xué)科排名
書目名稱Cryptography and Coding讀者反饋
書目名稱Cryptography and Coding讀者反饋學(xué)科排名
作者: 止痛藥 時(shí)間: 2025-3-21 21:05 作者: ANTIC 時(shí)間: 2025-3-22 01:42 作者: 機(jī)構(gòu) 時(shí)間: 2025-3-22 07:22
Notes on GGH13 Without the Presence of Idealsal vulnerability in the way that GGH13 encodings are constructed that lies deeper than the presence of .. Tangentially, we observe that our attack is prevented when considering all the added machinery of IO candidates.作者: 機(jī)警 時(shí)間: 2025-3-22 11:05
CAKE: ,ode-Based ,lgorithm for ,ey ,ncapsulationtocol based on CAKE, which is suitable for the Internet Key Exchange (IKE) standard. We prove that CAKE is IND-CPA secure, that the protocol is SK-Secure, and suggest practical parameters. Compared to other post-quantum schemes, we believe that CAKE is a promising candidate for post-quantum key exchange standardization.作者: 現(xiàn)任者 時(shí)間: 2025-3-22 14:20 作者: 現(xiàn)任者 時(shí)間: 2025-3-22 18:01
Creating and Managing Web Sites,some of the inefficiency pitfalls of existing constructions. We then provide efficient instantiations supporting expressive signing policies. We also give a concrete construction for threshold policies yielding constant-size signatures. Some of the building blocks we construct might be of independent interest.作者: lethal 時(shí)間: 2025-3-22 22:45 作者: LUT 時(shí)間: 2025-3-23 05:19 作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-23 06:15 作者: PUT 時(shí)間: 2025-3-23 11:49 作者: 機(jī)械 時(shí)間: 2025-3-23 17:24 作者: 協(xié)奏曲 時(shí)間: 2025-3-23 21:18 作者: 懲罰 時(shí)間: 2025-3-24 01:40 作者: 走調(diào) 時(shí)間: 2025-3-24 02:48
A Note on the Implementation of the Number Theoretic Transformgnature, and encryption. Here we apply a simple methodology to convert the NTT and its inverse from a mathematically correct (but side-channel vulnerable) description, to an efficient constant-time and side-channel resistant version.作者: 煞費(fèi)苦心 時(shí)間: 2025-3-24 07:33 作者: narcotic 時(shí)間: 2025-3-24 14:12
Promotion of Self-Regulated Learning,ur definitions of the Probability of Miscorrected Error are present in literature; aim of this work is to show that they are equivalent and, although different in the mathematical formulation, they yield exactly the same result. The gap of this missing proof is herein fulfilled and two examples with interesting properties are given.作者: 突變 時(shí)間: 2025-3-24 16:35
Revealing Encryption for Partial Orderingo vectors i.e., given . and . it is possible to learn whether ., ., . or whether . and . are incomparable. This is the first non-trivial example of a . scheme with output larger than one bit, and which does not rely on cryptographic obfuscation or multilinear maps.作者: Enervate 時(shí)間: 2025-3-24 22:40
Dynamic Multi Target Homomorphic Attribute-Based Encryptionduring homomorphic computation. In the previous MT-HABE of Brakerski et al. (TCC 2016-B), the output of homomorphic computation, which is related to a policy set, cannot be computed with a fresh ciphertext whose attribute does not satisfy any policy in the set. This is because the underlying multi-k作者: 微生物 時(shí)間: 2025-3-25 02:33 作者: 關(guān)節(jié)炎 時(shí)間: 2025-3-25 05:48
When It’s All Just Too Much: Outsourcing MPC-Preprocessingphase is tasked with producing some form of correlated randomness and distributing it to the parties. Whilst the “online” phase of such protocols is exceedingly fast, the bottleneck comes in the pre-processing phase. In this paper we examine situations in which the computing parties in the online ph作者: 頌揚(yáng)國(guó)家 時(shí)間: 2025-3-25 09:07
On the Probability of Incorrect Decoding for?Linear Codesss. Historically, the most considered parameters in the performance of a linear code are the Probability of Undetected Error and the probability of incorrect decoding, also known as Probability of Miscorrected Error. While there is agreement about the first, starting from the Seventies, basically fo作者: 英寸 時(shí)間: 2025-3-25 13:17
Improvement on Minimum Distance of?Symbol-Pair Codesorrecting capability of the code with respect to pair errors. The codes that achieve the optimal minimum pair distance (for given codeword length, code book size and alphabet) are called Maximum Distance Separable (MDS) symbol-pair codes. A way to study the minimum pair distance of a code is through作者: 陳列 時(shí)間: 2025-3-25 16:40
Notes on GGH13 Without the Presence of Ideals we show that we can alter the form of encodings so that effectively a new . is used for each source group ., while retaining correctness. This would appear to prevent all known attacks on IO candidates instantiated using GGH13. However, when analysing security in a simplified branching program mode作者: PACK 時(shí)間: 2025-3-25 22:48
Attribute-Based Signatures with User-Controlled Linkability Without Random Oraclesnature-related notions such as group, ring and mesh signatures. Attribute-Based Signatures with User-Controlled Linkability (ABS-UCL) add the notion of user-controlled linkability to ABS thus allowing users to anonymously and at will maintain a session with a verifier. In this work, we provide the f作者: Inkling 時(shí)間: 2025-3-26 02:19
How Low Can You Go? Short Structure-Preserving Signatures for?Diffie-Hellman Vectorsn the most efficient Type-3 bilinear group setting have a lower bound of 3-element signatures, which must include elements from both base groups, and a verification overhead of at least 2 Pairing-Product Equations (PPEs). Very recently, Ghadafi (ESORICS 2017) showed that by restricting the message s作者: ethereal 時(shí)間: 2025-3-26 08:15
CAKE: ,ode-Based ,lgorithm for ,ey ,ncapsulationerefore, devising quantum-resistant replacements that combine efficiency with solid security guarantees is an important and challenging task. This paper proposes several contributions towards this goal. First, we introduce “.”, a key encapsulation algorithm based on the QC-MDPC McEliece encryption s作者: Compass 時(shí)間: 2025-3-26 11:21 作者: 露天歷史劇 時(shí)間: 2025-3-26 13:15 作者: 分發(fā) 時(shí)間: 2025-3-26 17:31 作者: 座右銘 時(shí)間: 2025-3-26 21:38 作者: 低能兒 時(shí)間: 2025-3-27 02:16 作者: Ligneous 時(shí)間: 2025-3-27 08:46
Is what you ask for what you get?,during homomorphic computation. In the previous MT-HABE of Brakerski et al. (TCC 2016-B), the output of homomorphic computation, which is related to a policy set, cannot be computed with a fresh ciphertext whose attribute does not satisfy any policy in the set. This is because the underlying multi-k作者: TOM 時(shí)間: 2025-3-27 12:17 作者: 類型 時(shí)間: 2025-3-27 16:02 作者: LAITY 時(shí)間: 2025-3-27 19:04 作者: 感情 時(shí)間: 2025-3-27 22:36
Movies; Desktop Television Editing,orrecting capability of the code with respect to pair errors. The codes that achieve the optimal minimum pair distance (for given codeword length, code book size and alphabet) are called Maximum Distance Separable (MDS) symbol-pair codes. A way to study the minimum pair distance of a code is through作者: 沙草紙 時(shí)間: 2025-3-28 02:45 作者: gerrymander 時(shí)間: 2025-3-28 09:21 作者: bibliophile 時(shí)間: 2025-3-28 11:46 作者: 陰郁 時(shí)間: 2025-3-28 16:48 作者: Benzodiazepines 時(shí)間: 2025-3-28 20:14
Research on Teaching; Web Issues,ource constrained environments where critical resources such as processing power, memory and bandwidth are severely limited. This research examines the first pragmatic lattice-based IBE scheme presented by Ducas, Lyubashevsky and Prest in 2014 and brings it into the realm of practicality for use on 作者: Dappled 時(shí)間: 2025-3-29 01:37 作者: Thyroid-Gland 時(shí)間: 2025-3-29 04:43 作者: intricacy 時(shí)間: 2025-3-29 08:29
Empty victories, harmless defeats,o vectors i.e., given . and . it is possible to learn whether ., ., . or whether . and . are incomparable. This is the first non-trivial example of a . scheme with output larger than one bit, and which does not rely on cryptographic obfuscation or multilinear maps.作者: micronized 時(shí)間: 2025-3-29 15:18
Conference proceedings 2017This book constitutes the proceedings of the 16th IMA International Conference on Cryptography and Coding, IMACC 2017, held at Oxford, UK, in December 2017. The 19 papers presented were carefully reviewed and selected from 32 submissions. The conference focuses on?a diverse set of topics both in cryptography and coding theory.作者: Debility 時(shí)間: 2025-3-29 16:25
https://doi.org/10.1007/978-3-319-71045-7Authentication; Cryptography; Multi-party computation; Cryptanalysis; Coding Theory; data security; crypto作者: 效果 時(shí)間: 2025-3-29 20:26 作者: Ankylo- 時(shí)間: 2025-3-30 01:26
Máire O‘NeillIncludes supplementary material: 作者: 逃避責(zé)任 時(shí)間: 2025-3-30 06:44 作者: Deduct 時(shí)間: 2025-3-30 10:39
Lecturing; Multimedia Classrooms,In this paper, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a group of nilpotency class 2. We discuss an example at the end.作者: 廢除 時(shí)間: 2025-3-30 16:11 作者: BARK 時(shí)間: 2025-3-30 17:02 作者: Rodent 時(shí)間: 2025-3-31 00:09
