標(biāo)題: Titlebook: Applied Cryptography and Network Security; 22nd International C Christina P?pper,Lejla Batina Conference proceedings 2024 The Editor(s) (if [打印本頁] 作者: papertrans 時(shí)間: 2025-3-21 19:00
書目名稱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é)科排名
作者: Irremediable 時(shí)間: 2025-3-21 22:07
Conference proceedings 2024230 submissions. They have been organized in topical sections as follows:?.Part I: Cryptographic protocols; encrypted data; signatures;?.Part II: Post-quantum; lattices; wireless and networks; privacy and homomorphic encryption; symmetric crypto;?.Part III: Blockchain; smart infrastructures, systems and software; attacks; users and usability..作者: Extemporize 時(shí)間: 2025-3-22 00:50 作者: 藥物 時(shí)間: 2025-3-22 07:04
Menna Eid,S. M. El-Marsafy,M. Bassyounie security of . linearly increases with ., achieving beyond-birthday-bound security. With a .-bit tag, . lies . depending on the target AE. We set . for ., ., and ., and the corresponding bound ./2 is tight for . and .. With ., ., and the bound . is tight.作者: DAUNT 時(shí)間: 2025-3-22 09:12 作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-22 16:47
KIVR: Committing Authenticated Encryption Using Redundancy and?Application to?GCM, CCM, and?Moree security of . linearly increases with ., achieving beyond-birthday-bound security. With a .-bit tag, . lies . depending on the target AE. We set . for ., ., and ., and the corresponding bound ./2 is tight for . and .. With ., ., and the bound . is tight.作者: 諷刺滑稽戲劇 時(shí)間: 2025-3-22 18:20 作者: 無動(dòng)于衷 時(shí)間: 2025-3-22 22:06
Irshad Ahmed Sumra,Ahmad Naeem Akhtar hierarchical structure (Abdalla et al. (JoC 2008)) or attribute-based feature (Zeng et al. (IEEE Transactions on Cloud Computing 2022)) of the previous generic constructions which is meaningful from a feasibility perspective.作者: 割讓 時(shí)間: 2025-3-23 02:25 作者: grovel 時(shí)間: 2025-3-23 08:56 作者: 懸掛 時(shí)間: 2025-3-23 12:54 作者: FER 時(shí)間: 2025-3-23 14:13
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159730.jpg作者: LINES 時(shí)間: 2025-3-23 21:43 作者: 我要威脅 時(shí)間: 2025-3-24 00:45
978-3-031-54769-0The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: expansive 時(shí)間: 2025-3-24 03:50 作者: 基因組 時(shí)間: 2025-3-24 06:47 作者: 退出可食用 時(shí)間: 2025-3-24 13:03 作者: 歌劇等 時(shí)間: 2025-3-24 17:14
Witold ?orski,Bartosz Drogosiewicz proposed an environmental-adaptive framework (CSS ’21) but failed to formalize the security. The similarity between their framework and attribute-based credentials (ABC) inspires us to reconsider contact tracing from the perspective of ABC schemes. In such schemes, users can obtain credentials on a作者: debble 時(shí)間: 2025-3-24 20:13 作者: 松果 時(shí)間: 2025-3-24 23:16 作者: 拋物線 時(shí)間: 2025-3-25 04:28
Aleksander Jarz?bowicz,Wojciech ?lesińskiearch has focused on two tasks: 1) showing security for as many distributions as possible and 2) providing stronger security guarantees including allowing one to enroll the same value multiple times (reusability), security against an active attacker (robustness), and preventing leakage about the enr作者: Mri485 時(shí)間: 2025-3-25 07:52
Albert Ambroziewicz,Micha? ?mia?ek a potential solution but require secure fuzzy extractors to ensure reliable replication. This paper introduces X-Lock, a novel and secure computational fuzzy extractor that addresses the limitations faced by traditional solutions in resource-constrained IoT devices. X-Lock offers a reusable and rob作者: intangibility 時(shí)間: 2025-3-25 12:42 作者: 思考才皺眉 時(shí)間: 2025-3-25 18:12
Irshad Ahmed Sumra,Ahmad Naeem Akhtarddition to PAEKS, we employ 0/1 encodings proposed by Lin et al. (ACNS 2005). Here, forward security means that a newly generated ciphertext is not allowed to be searched by previously generated trapdoors. We also show that the Jiang et al. FS-PAEKS scheme (The Computer Journal 2023) does not provid作者: giggle 時(shí)間: 2025-3-25 23:53
Israr Ahmad,Adeel Ahmed,Saima Abdullaherlasting privacy without assuming the existence of an anonymous channel..Our schemes support the two most traditional election tallying methods: One is additively homomorphic, supporting elections in which votes simply need to be added, but decryption is only efficient for a message space of polylo作者: 膝蓋 時(shí)間: 2025-3-26 01:57
Engineering Software for Modern Challenges privacy when working with potentially sensitive data. While there is already a variety of protocols in this setting based on fully homomorphic encryption or secure multiparty computation (MPC), we are the first to propose a protocol that makes use of a specialized Order-Revealing Encryption scheme.作者: 河流 時(shí)間: 2025-3-26 07:33 作者: Modify 時(shí)間: 2025-3-26 11:50 作者: facilitate 時(shí)間: 2025-3-26 13:54 作者: 使習(xí)慣于 時(shí)間: 2025-3-26 18:39 作者: Inflated 時(shí)間: 2025-3-26 23:53
CryptoZoo: A Viewer for?Reduction Proofs studies: The equivalence between simulation-based and game-based notions for symmetric encryption, the security proof of the Goldreich-Goldwasser-Micali construction of a pseudorandom function from a pseudorandom generator, and Brzuska’s and Oechsner’s SSP formalization of the proof for Yao’s garbl作者: Arroyo 時(shí)間: 2025-3-27 04:48 作者: 清醒 時(shí)間: 2025-3-27 09:12
A New Approach to?Efficient and?Secure Fixed-Point Computatione used to realize highly efficient secure fixed-point computation. In contrast to previous approaches, our protocol does not require any multiplications of secret values in the underlying MPC scheme to realize truncation but instead relies on preprocessed pairs of correlated random values, which we 作者: Thrombolysis 時(shí)間: 2025-3-27 13:17 作者: 煉油廠 時(shí)間: 2025-3-27 17:20
Verification Protocol for?Stable Matching from?Conditional Disclosure of?Secrets protocol for stable matching against a malicious server. Our verification protocol is constructed from CDS schemes for stable matching, which do not require any asymmetric-key cryptographic primitives. From the implementation result, our proposed protocol is 4 to 5 orders of magnitude faster than t作者: CAMP 時(shí)間: 2025-3-27 19:59 作者: Freeze 時(shí)間: 2025-3-28 00:12 作者: 符合規(guī)定 時(shí)間: 2025-3-28 04:46 作者: 出血 時(shí)間: 2025-3-28 07:32 作者: Asymptomatic 時(shí)間: 2025-3-28 10:45 作者: intrigue 時(shí)間: 2025-3-28 15:14 作者: CRASS 時(shí)間: 2025-3-28 22:20
Practical Lattice-Based Distributed Signatures for?a?Small Number of?Signersr, the protocols use trapdoor homomorphic commitments as a further cryptographic building block, making their deployment in practice not as easy as standard lattice-based Fiat-Shamir signatures. In this work, we present a new construction of .-out-of-. distributed signatures. It is designed specific作者: mastoid-bone 時(shí)間: 2025-3-29 02:41
Building MPCitH-Based Signatures from?MQ, MinRank, and?Rank SDcheme does not always outperform the existing ones according to the communication cost, they are compatible with some MPC-in-the-Head techniques while the former proposals were not..Moreover, we propose two efficient MPC protocols to check that the rank of a matrix over a field . is upper bounded by作者: Mechanics 時(shí)間: 2025-3-29 06:28 作者: 古文字學(xué) 時(shí)間: 2025-3-29 10:23 作者: freight 時(shí)間: 2025-3-29 14:08 作者: Ganglion 時(shí)間: 2025-3-29 18:25 作者: Ballerina 時(shí)間: 2025-3-29 20:02 作者: BILE 時(shí)間: 2025-3-30 00:22
Andrzej Stasiak,Zbigniew Zielińskissuming only minimal min-entropy (in fact, .), while still being useful for applications. We identify one such property and put forward the notion of . fuzzy extractors. Intuitively, non-malleability relaxes the robustness property by allowing the reconstructed key using a modified helper string to 作者: 上下連貫 時(shí)間: 2025-3-30 06:14 作者: THE 時(shí)間: 2025-3-30 11:24
Irshad Ahmed Sumra,Ahmad Naeem Akhtarcal k-means algorithm. Compared to a state-of-the-art FHE-based scheme, our original algorithm not only outperforms theirs in accuracy but is also 4 orders of magnitude faster than theirs. In experiments testing our block algorithm, we conclude that the run time and memory consumption of this algori作者: aqueduct 時(shí)間: 2025-3-30 14:01
Israr Ahmad,Adeel Ahmed,Saima AbdullahCRS (or on the random oracle model). This improves on previous TREnc mechanisms that required a structured CRS and is of independent interest. A prototype implementation of our mechanisms is proposed, which shows that ballot preparation and verification can be executed in less than a second.作者: JADED 時(shí)間: 2025-3-30 16:43
Engineering Software for Modern Challengesdata provided by both parties. The protocol is in the passively-secure setting and has some leakage on the data that arises from the comparison function on the ciphertexts. We motivate how our protocol can be compiled into an actively-secure protocol with less leakage using secure enclaves, in a gra作者: conscribe 時(shí)間: 2025-3-30 22:43
Asmaa Ahmed,Mohamed Elsakka,Ayman MohamedWe demonstrate that one-way permutations naturally yield subversion-resilient one-way functions, thereby enabling us to establish the subversion-resilience of Lamport signatures, assuming a trusted comparison is available. Additionally, we develop subversion-resilient target-collision-resistant hash作者: commonsense 時(shí)間: 2025-3-31 01:27
The Minerals, Metals & Materials Seriesr, the protocols use trapdoor homomorphic commitments as a further cryptographic building block, making their deployment in practice not as easy as standard lattice-based Fiat-Shamir signatures. In this work, we present a new construction of .-out-of-. distributed signatures. It is designed specific作者: 饑荒 時(shí)間: 2025-3-31 08:09 作者: anticipate 時(shí)間: 2025-3-31 10:30 作者: 混合物 時(shí)間: 2025-3-31 13:59 作者: CREST 時(shí)間: 2025-3-31 17:47
A New Approach to?Efficient and?Secure Fixed-Point Computationn real-world applications require the usage of decimal numbers. While it is possible to emulate floating-point operations in MPC, fixed-point computation has gained more traction in the practical space due to its simplicity and efficient realizations. Even so, current protocols for fixed-point MPC s
