標(biāo)題: Titlebook: Cryptology and Network Security; 18th International C Yi Mu,Robert H. Deng,Xinyi Huang Conference proceedings 2019 Springer Nature Switzerl [打印本頁] 作者: coherent 時(shí)間: 2025-3-21 18:09
書目名稱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é)科排名
作者: Oversee 時(shí)間: 2025-3-21 21:02 作者: 離開 時(shí)間: 2025-3-22 02:31 作者: 畫布 時(shí)間: 2025-3-22 07:13 作者: 魅力 時(shí)間: 2025-3-22 09:02 作者: Hallmark 時(shí)間: 2025-3-22 16:05 作者: Hallmark 時(shí)間: 2025-3-22 19:55
Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explih lattice-based constructions are not that efficient..??? In this work, we propose a much more efficient lattice-based ., which is efficient by saving the . factor for both bit-sizes of the group public-key and the member secret-key. Moreover, we achieve this result in a relatively simple manner. St作者: 不持續(xù)就爆 時(shí)間: 2025-3-22 23:06
Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Settinge mOW-CPA security can be tightly reduced to the underlying post-quantum assumptions by showing the tight mOW-CPA security of two concrete PKE schemes based on LWE, where one is the Regev’s PKE scheme and the other is a variant of Frodo.作者: prostatitis 時(shí)間: 2025-3-23 03:21 作者: 設(shè)想 時(shí)間: 2025-3-23 09:10 作者: 無畏 時(shí)間: 2025-3-23 12:19 作者: 有權(quán)威 時(shí)間: 2025-3-23 14:58
Frederick H. Kanfer,Dieter Schmelzerto FHE, in order to more efficiently address real-world applications.The paper is concluded by experimental results on a face recognition application demonstrating the ability of the approach to provide reasonable recognition timings (.?s) on a single standard processor core.作者: avarice 時(shí)間: 2025-3-23 20:00 作者: 不真 時(shí)間: 2025-3-23 22:25
Grundlegende Begriffe und Konzepte, algorithm safer. In addition, we find an RX-colliding characteristic with probability . for a revised version of SipHash-1-x with one message block, and an RX-colliding characteristic with probability . for a revised version of SipHash-1-x with two message blocks. With the SMT-based technique, whic作者: BACLE 時(shí)間: 2025-3-24 06:07 作者: obligation 時(shí)間: 2025-3-24 10:22
Grundlegende Begriffe und Konzepte,implification. Furthermore, based on the technique for lattice basis delegation in fixed dimension, we construct our second RHIBE scheme in the random oracle model. It has much shorter items in keys and ciphertexts than before, and also achieves the adaptive-identity security under the learning with作者: Dictation 時(shí)間: 2025-3-24 14:20 作者: 大方一點(diǎn) 時(shí)間: 2025-3-24 15:48 作者: Coeval 時(shí)間: 2025-3-24 20:41 作者: 協(xié)議 時(shí)間: 2025-3-24 23:39
https://doi.org/10.1007/b138788ance with balanced index forest that makes full use of distributed computing. Compared with previous works, our solution maintains query precision above 95% while ensuring adequate privacy protection, and introduces low overhead on computation, communication and storage.作者: 哥哥噴涌而出 時(shí)間: 2025-3-25 03:25
Frederick H. Kanfer,Dieter Schmelzernd ., there is an efficient algorithm to compute ., where . and . are (binary) group operations. The homomorphism on the input is restricted to a fixed subset of the input bits, i.e., . operates on some pre-decided .-out-of-. bits, where ., and the remaining . bits are identical in both inputs. In a作者: Hemodialysis 時(shí)間: 2025-3-25 07:41 作者: 咆哮 時(shí)間: 2025-3-25 14:52
https://doi.org/10.1007/b138788y levels on 32-bit ARM Cortex-M4 microcontrollers. The proposed library introduces a new speed record of SIKE protocol on the target platform. We achieved this record by adopting several state-of-the-art engineering techniques as well as highly-optimized hand-crafted assembly implementation of finit作者: 消瘦 時(shí)間: 2025-3-25 16:16
Grundlegende Begriffe und Konzepte,t analysis method against ARX algorithm—“Rotational-XOR cryptanalysis”. Inspired by their work, we mount differential and Rotational-XOR cryptanalysis on two instances of SipHash-1-x and SipHash-2-x in this paper, where SipHash-1-x (or SipHash-2-x) represents the Siphash instance with one (or two) c作者: 過分 時(shí)間: 2025-3-25 23:45
Grundlegende Begriffe und Konzepte,aphy (ECC). Most recently, quantum-safe cryptographic systems are proposed based on supersingular isogenies on elliptic curves which require large integer multiplications over extended prime fields. In this work, we present two Montgomery multiplication architectures for special primes used in a pos作者: 剛開始 時(shí)間: 2025-3-26 02:28
Grundlegende Begriffe und Konzepte, which are two important functionalities for cryptographic use in practice. Recently in PKC 2019, Katsumata et al. constructed the first lattice-based RHIBE scheme with decryption key exposure resistance (DKER). Such constructions are all based on bilinear or multilinear maps before their work. In t作者: 走路左晃右晃 時(shí)間: 2025-3-26 05:14
https://doi.org/10.1007/b138788., a revocation list, ., consists of a series of revocation tokens for revoked members), but not the signers. The first such scheme was introduced by Langlois et al. in 2014, and subsequently, a full and corrected version (to fix a flaw in the original revocation mechanism) was proposed by Ling et a作者: invade 時(shí)間: 2025-3-26 12:33 作者: GLUT 時(shí)間: 2025-3-26 13:51 作者: ASTER 時(shí)間: 2025-3-26 16:56
https://doi.org/10.1007/b138788a outsourced by data owners. However, implementing secure and precise query, efficient search and flexible dynamic system maintenance at the same time in SSE remains a challenge. To address this, this paper proposes secure and efficient multi-keyword ranked search over encrypted cloud data for multi作者: Tortuous 時(shí)間: 2025-3-27 00:43
Grundlegende Begriffe und Konzepte, industry, many people start to explore the possibility of implementing blockchain technology in different fields. In this paper, we propose Smart Stamp Duty, a system which can revolutionize the way stamp duty (document tax) is managed and paid. The proposed Smart Stamp Duty offers significant impr作者: 假 時(shí)間: 2025-3-27 03:54
Grundlegende Begriffe und Konzepte,s that process sensitive information. This paper aims to solve three important problems for practical blockchain applications: privacy, authentication and auditability..Private transaction means that the transaction can be validated without revealing the transaction details, such as the identity of 作者: ODIUM 時(shí)間: 2025-3-27 07:02 作者: HAIL 時(shí)間: 2025-3-27 10:14 作者: 改變立場(chǎng) 時(shí)間: 2025-3-27 17:41
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/240609.jpg作者: Mhc-Molecule 時(shí)間: 2025-3-27 18:12
https://doi.org/10.1007/978-3-030-31578-8authentication; access control; cryptanalysis and other attacks; database and storage security; mathemat作者: 粗魯性質(zhì) 時(shí)間: 2025-3-28 01:13
978-3-030-31577-1Springer Nature Switzerland AG 2019作者: Sad570 時(shí)間: 2025-3-28 04:31 作者: Physiatrist 時(shí)間: 2025-3-28 09:18 作者: 勛章 時(shí)間: 2025-3-28 14:23
Grundlegende Begriffe und Konzepte,torage. Our protocol utilises the fee-less transaction feature provided by Tron. By using this feature, storing an arbitrary size data can be done cheaply. We show that our protocol is sustainable such that after initialisation phase, the permanent data storage capacity is provided for free on daily basis.作者: Additive 時(shí)間: 2025-3-28 18:28
Grundlegende Begriffe und Konzepte,. Smart stamp duty also enables the taxpayers to pay the stamp duty of their electronic documents. Our proposed system also enables the taxpayers to convert their electronic documents into physical documents while still maintain the ability to refer the electronic-based stamp duty payments.作者: 使害羞 時(shí)間: 2025-3-28 20:49
Designing Smart Contract for Electronic Document Taxation. Smart stamp duty also enables the taxpayers to pay the stamp duty of their electronic documents. Our proposed system also enables the taxpayers to convert their electronic documents into physical documents while still maintain the ability to refer the electronic-based stamp duty payments.作者: 孤獨(dú)無助 時(shí)間: 2025-3-29 01:52
Conference proceedings 2019ina, in October 2019..The 21 full papers and 8 short papers were carefully reviewed and selected from 55 submissions. The papers focus on topics such as homomorphic encryption; SIKE and Hash; lattice and post-quantum cryptography; searchable encryption; blockchains, cloud security; secret sharing an作者: 消毒 時(shí)間: 2025-3-29 04:00 作者: –DOX 時(shí)間: 2025-3-29 10:49
PAChain: Private, Authenticated and Auditable Consortium Blockchainulators or law enforcement agencies. Authenticated transaction means that only authorized parties can be involved in the transaction. In this paper, we present a private, authenticated and auditable consortium blockchain, using a number of cryptographic building blocks.作者: 護(hù)航艦 時(shí)間: 2025-3-29 13:59 作者: thwart 時(shí)間: 2025-3-29 15:41 作者: Ascribe 時(shí)間: 2025-3-29 22:11
Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryptionnd ., there is an efficient algorithm to compute ., where . and . are (binary) group operations. The homomorphism on the input is restricted to a fixed subset of the input bits, i.e., . operates on some pre-decided .-out-of-. bits, where ., and the remaining . bits are identical in both inputs. In a作者: Daily-Value 時(shí)間: 2025-3-30 03:22 作者: recede 時(shí)間: 2025-3-30 05:53
SIKE Round 2 Speed Record on ARM Cortex-M4y levels on 32-bit ARM Cortex-M4 microcontrollers. The proposed library introduces a new speed record of SIKE protocol on the target platform. We achieved this record by adopting several state-of-the-art engineering techniques as well as highly-optimized hand-crafted assembly implementation of finit作者: GLUT 時(shí)間: 2025-3-30 09:32 作者: 擔(dān)心 時(shí)間: 2025-3-30 14:24
Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptographyaphy (ECC). Most recently, quantum-safe cryptographic systems are proposed based on supersingular isogenies on elliptic curves which require large integer multiplications over extended prime fields. In this work, we present two Montgomery multiplication architectures for special primes used in a pos
