標(biāo)題: Titlebook: Applied Cryptography and Network Security; 19th International C Kazue Sako,Nils Ole Tippenhauer Conference proceedings 2021 Springer Nature [打印本頁] 作者: 支票 時間: 2025-3-21 17:36
書目名稱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é)科排名
作者: Range-Of-Motion 時間: 2025-3-21 23:54 作者: 填料 時間: 2025-3-22 02:11 作者: 花束 時間: 2025-3-22 08:04 作者: magnanimity 時間: 2025-3-22 10:56
0302-9743 Security, ACNS 2021, which took place virtually during June 21-24, 2021. ..The 37 full papers presented in the proceedings were carefully reviewed and selected from a total of 186 submissions. They were organized in topical sections as follows:..Part I: Cryptographic protocols; secure and fair proto作者: 沒有準(zhǔn)備 時間: 2025-3-22 15:22 作者: 硬化 時間: 2025-3-22 19:29
SnakeGX: A Sneaky Attack Against SGX?Enclavescally designed to overcome the challenges SGX environments pose, while preserving their integrity and functionality. We thoroughly evaluate SnakeGX against StealthDB, which demonstrates the feasibility of our approach.作者: fodlder 時間: 2025-3-22 21:18
Conference proceedings 2021ACNS 2021, which took place virtually during June 21-24, 2021. ..The 37 full papers presented in the proceedings were carefully reviewed and selected from a total of 186 submissions. They were organized in topical sections as follows:..Part I: Cryptographic protocols; secure and fair protocols; cryp作者: habitat 時間: 2025-3-23 05:14
Lecture Notes in Computer Sciencemodel. Furthermore, it has the advantage that the computational complexity of pairing and exponentiation operations and the communication complexity do not depend on the depth of the hierarchy. Also, the other concrete instantiation achieves the first HID-AKE scheme based on lattices (i.e., post-quantum).作者: quiet-sleep 時間: 2025-3-23 09:16 作者: 無能的人 時間: 2025-3-23 11:09 作者: cornucopia 時間: 2025-3-23 14:03
Telepathic Headache: Mitigating Cache Side-Channel Attacks on Convolutional Neural Networks computations are made and add randomness to the said computations in order to mitigate Cache Telepathy. The security analysis of our protection shows that the Cache Telepathy attack on a protected VGG-16 has an increased search space: from 16 to ..作者: armistice 時間: 2025-3-23 19:03
Lecture Notes in Computer Sciencecation based on their IDs with the hierarchical delegation of key generation functionality. All existing HID-AKE schemes are selective ID secure, and the only known standard model scheme relies on a non-standard assumption such as the .-type assumption. In this paper, we propose a generic constructi作者: 引起痛苦 時間: 2025-3-23 23:26 作者: myriad 時間: 2025-3-24 06:22 作者: 煩躁的女人 時間: 2025-3-24 08:10 作者: 晚來的提名 時間: 2025-3-24 12:42
Engineering Secure Software and Systems scenarios, sellers prefer to sell pieces of data, such as statistical results derived from the dataset, rather than the entire dataset. Meanwhile, buyers wish to hide the results they retrieve. Since it is not preferable to rely on a trusted third party (TTP), we are wondering, in the absence of TT作者: faction 時間: 2025-3-24 18:10
MEDS: The Memory Error Detection System or no item changes hands. The two-party case was widely studied starting with the seminal work of Asokan et al. in ACM CCS 1998. The state-of-the-art MFE protocol was shown by K?l?n? and Küp?ü in CT-RSA 2015. Unfortunately, it only works on items that can be efficiently verifiably encrypted, which,作者: Promotion 時間: 2025-3-24 19:09
Denis Butin,David Gray,Giampaolo Bellavices that make all orders public before they are settled. The latter allows market participants to “front run” each other, an illegal operation in most jurisdictions. We extend the “Insured MPC” approach of Baum . (FC 2020) to construct an efficient universally composable privacy preserving decentr作者: exquisite 時間: 2025-3-25 02:20 作者: 神刊 時間: 2025-3-25 06:27
Nina Moebius,Kurt Stenzel,Wolfgang Reifraging blockchain technology. We show that through smart contracts there can be an on-line market where infected individuals interested in monetizing their status can upload to the servers of the GAEN-based systems some keys (i.e., TEKs) chosen by a non-infected adversary. In particular, the infecte作者: Presbycusis 時間: 2025-3-25 09:07 作者: reflection 時間: 2025-3-25 12:56
Lecture Notes in Computer Scienceserving Signature (PSPS) schemes. PSPS schemes are similar in nature to structure-preserving signatures with the exception that in PSPS schemes messages are scalars from . instead of being group elements. This class encompasses various existing schemes which have a number of desirable features which作者: 邪惡的你 時間: 2025-3-25 17:41 作者: 柔聲地說 時間: 2025-3-25 23:58 作者: 喃喃訴苦 時間: 2025-3-26 02:34 作者: Anecdote 時間: 2025-3-26 07:48 作者: languor 時間: 2025-3-26 10:41
https://doi.org/10.1007/978-3-030-78372-3access control; computer networks; computer security; cryptanalysis and other attacks; cryptography; data作者: TSH582 時間: 2025-3-26 13:18 作者: AVID 時間: 2025-3-26 17:48
Applied Cryptography and Network Security978-3-030-78372-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 織布機(jī) 時間: 2025-3-26 21:47
Engineering Secure Software and Systemse hash functions are specified ambiguously, that may lead to the failure of implementations. Besides, in existing papers, the security analyses of long-term time-stamping schemes only cover the server-side renewal, and the client-side renewal is missing. In this paper, we analyse the necessity of cl作者: FOIL 時間: 2025-3-27 03:04 作者: Archipelago 時間: 2025-3-27 06:50 作者: SEVER 時間: 2025-3-27 09:41 作者: Microaneurysm 時間: 2025-3-27 15:04
MEDS: The Memory Error Detection Systeme any item, be it a large file. While doing so, we employ electronic payments, where if a party does not obtain the desired item at the end of the protocol, the payment of the item’s owner will be obtained instead. Third, we achieve asymptotic optimality with .(1) rounds and . messages, where . is t作者: explicit 時間: 2025-3-27 21:17
Denis Butin,David Gray,Giampaolo Bellanecessary for a centralized exchange. In case malicious behavior is detected, users are automatically refunded by malicious servers at low cost. Thus, an actively corrupted majority can only mount a denial-of-service attack that makes exchanges fail, in which case the servers are publicly identified作者: 和平主義者 時間: 2025-3-28 01:31 作者: constitutional 時間: 2025-3-28 04:08 作者: 詞根詞綴法 時間: 2025-3-28 09:41
Lecture Notes in Computer Scienceose our own scheme, ULISS (Unlinkable Limited Invisible Sanitizable Signature), then show that it verifies these properties. This extension of SaS can not only improve current use cases, but also introduce new ones, ., restricting the number of changes in a document within a certain timeframe.作者: 泛濫 時間: 2025-3-28 12:39 作者: minaret 時間: 2025-3-28 16:08
Analysis of Client-Side Security for?Long-Term Time-Stamping Servicese hash functions are specified ambiguously, that may lead to the failure of implementations. Besides, in existing papers, the security analyses of long-term time-stamping schemes only cover the server-side renewal, and the client-side renewal is missing. In this paper, we analyse the necessity of cl作者: Latency 時間: 2025-3-28 22:27 作者: nutrition 時間: 2025-3-29 00:34
CECMLP: New Cipher-Based Evaluating Collaborative Multi-layer Perceptron Scheme in Federated Learninh participant’s training set privacy and reliability privacy from being revealed to the public. Moreover, to further reduce the impact of unreliable participants and improve training efficiency, we design a cipher-based reliability weighted method to differentiate and intensify different contributio作者: 欺騙世家 時間: 2025-3-29 04:29 作者: 芭蕾舞女演員 時間: 2025-3-29 07:20
Coin-Based Multi-party Fair Exchangee any item, be it a large file. While doing so, we employ electronic payments, where if a party does not obtain the desired item at the end of the protocol, the payment of the item’s owner will be obtained instead. Third, we achieve asymptotic optimality with .(1) rounds and . messages, where . is t作者: aviator 時間: 2025-3-29 13:56 作者: oxidize 時間: 2025-3-29 17:36
Up My Sleeve! A Hidden Secure Fallback for Cryptocurrency Walletsased on ECDSA, and adds a . signing key as a “back up key”. Thus offering a quantum secure .. This design allows the hiding of any quantum secure signature key pair, and is not exclusive to .. Finally, we briefly discuss the construction of multiple generations of proofs of ownership.作者: 包裹 時間: 2025-3-29 20:39 作者: TIA742 時間: 2025-3-30 01:13
Unlinkable and Invisible ,-Sanitizable Signaturesose our own scheme, ULISS (Unlinkable Limited Invisible Sanitizable Signature), then show that it verifies these properties. This extension of SaS can not only improve current use cases, but also introduce new ones, ., restricting the number of changes in a document within a certain timeframe.作者: 大方一點(diǎn) 時間: 2025-3-30 07:31 作者: follicular-unit 時間: 2025-3-30 10:02 作者: Brain-Imaging 時間: 2025-3-30 15:46
Analysis of Client-Side Security for?Long-Term Time-Stamping Servicesrifiable cryptographic bindings between data and time, which are produced using cryptographic algorithms. In the ANSI, ISO/IEC and IETF standards for time-stamping services, cryptographic algorithms are addressed in two aspects: (i) Client-side hash functions used to hash data into digests for nondi作者: AMOR 時間: 2025-3-30 19:54
