作者: Formidable 時間: 2025-3-21 20:51
https://doi.org/10.1007/978-3-031-35013-9sed Long-Term Time-Stamping (BLTTS) scheme. To develop a BLTTS scheme, we first consider an intuitive solution that directly combines the BTS services and a long-term secure blockchain, but we prove that this solution is vulnerable to attacks in the long term. With this insight, we propose the first作者: 積云 時間: 2025-3-22 04:11
Nancy Giunta,Stephanie A. Jacobsonifferent key life-time. Our extensive performance evaluation, analysis and implementation indicate the effectiveness of our proposed constructions in practice. Particularly, we demonstrate that . is the most efficient quantum-safe VRF with a maximum proof size of 3 KB and a possible TPS of 449 for a作者: 繞著哥哥問 時間: 2025-3-22 05:54
Cheryl Waites,Angela Kaiser,Fayetta Martinno’s EUTXO model, appear more robust against ., we nevertheless demonstrate scenarios where transactions are . and thus vulnerable. To determine whether .-like semantics can be observed in practice, we analyze the execution traces of . transactions on the Ethereum blockchain. Hereby, we are able to 作者: calorie 時間: 2025-3-22 09:54
Fluorescent Minerals Worldwide,er privacy. Consequently, SA has also attracted much attention and been widely used in the community. However, as so far, there is not a . wallet algorithm that provides the virtues of both HDW and SA. Actually, even for standalone HDW, to the best of our knowledge, there is no strict definition of 作者: 賠償 時間: 2025-3-22 13:43 作者: 賠償 時間: 2025-3-22 17:05
Saving Collegians to Save the Worldiction performance of using such features is minimal, since two features alone are capable of capturing a relevant effect of context changes, namely the category of the requesting application and the requested permission. Our methods for prediction of privacy preferences achieved an F1 score of 0.88作者: Canary 時間: 2025-3-23 01:02
https://doi.org/10.1057/9780230603387 the cross-silo setting). Existing approaches do not provide a scalable mechanism for privacy-preserving FL to be utilized under such settings, potentially with untrusted parties. This paper proposes a new local differentially private FL protocol (named LDPFL) for industrial settings. LDPFL can run 作者: STELL 時間: 2025-3-23 03:26
https://doi.org/10.1057/9780230603387t SPIR scheme. Our scheme is based on homomorphic encryption from ring-LWE like recent PIR works, but achieves a stronger security guarantee with low performance overhead. We implement XSPIR, and run experiments comparing its performance against SealPIR (Angel et al., IEEE S &P 2018) and MulPIR (Ali作者: Onerous 時間: 2025-3-23 09:00 作者: 和平主義者 時間: 2025-3-23 12:58 作者: 大門在匯總 時間: 2025-3-23 14:12 作者: 點燃 時間: 2025-3-23 18:29 作者: 證明無罪 時間: 2025-3-23 23:02 作者: harmony 時間: 2025-3-24 05:54 作者: Foreknowledge 時間: 2025-3-24 09:38
Opportunistic Algorithmic Double-Spending:no’s EUTXO model, appear more robust against ., we nevertheless demonstrate scenarios where transactions are . and thus vulnerable. To determine whether .-like semantics can be observed in practice, we analyze the execution traces of . transactions on the Ethereum blockchain. Hereby, we are able to 作者: 增強 時間: 2025-3-24 14:40 作者: 慢跑 時間: 2025-3-24 18:26
Privacy Leakage in?Privacy-Preserving Neural Network Inferencee claimed-secure protocols do not meet the underlying security model. We then go into particular steps in . and demonstrate that the signs of input data would be inevitably revealed to the (either semi-honest or malicious) third party responsible for assisting protocol executions. To show such leaka作者: Perineum 時間: 2025-3-24 21:54 作者: 干涉 時間: 2025-3-24 23:17 作者: Harpoon 時間: 2025-3-25 04:49 作者: 尾巴 時間: 2025-3-25 08:15 作者: Conspiracy 時間: 2025-3-25 12:19
Spatial Encryption Revisited: From Delegatable Multiple Inner Product Encryption and?Moret, we then successfully instantiate a concrete DMIPE construction relying on the hardness of the decisional learning with errors problem. In turn, the DMIPE design implies a more compact lattice-based SE in terms of sizes compared with SEs converted from HIPE (e.g., Xagawa’s HIPE at PKC 2013) using 作者: infatuation 時間: 2025-3-25 19:19 作者: 騎師 時間: 2025-3-25 22:54
An Efficient Query Recovery Attack Against a?Graph Encryption Schemeutput is guaranteed to contain the correct query. For a graph on . vertices, our attack runs in time . and matches the time complexity of the GKT scheme’s setup. We evaluate the attack’s performance using the real world datasets used in the original paper and show that as many as 21.9% of the querie作者: Adrenal-Glands 時間: 2025-3-26 01:23
A Blockchain-Based Long-Term Time-Stamping Schemes authority, decentralized Blockchain-based Time-Stamping (BTS) services have been proposed. In these services, a hash digest of users’ data is written into a blockchain transaction. The security of such services relies on the security of hash functions used to hash the data, and of the cryptographi作者: choleretic 時間: 2025-3-26 05:11 作者: 藕床生厭倦 時間: 2025-3-26 11:25 作者: 象形文字 時間: 2025-3-26 13:39
Zero-History Confidential Chains with?Zero-Knowledge Contracts: A New Normal for?Decentralized Ledgeomputational fees, and impractical overheads for syncing. The origin of these problems is . that comes with the architecture of “append-only” blockchains, e.g., Bitcoin, Ethereum, Hyperledger, etc. Zero-history blockchains like Origami address the root of these problems by removing the history. We p作者: RODE 時間: 2025-3-26 18:24 作者: 該得 時間: 2025-3-26 23:17
Zero-Knowledge Age Restriction for GNU Talerresented as an extension of a privacy-friendly payment protocol with a zero-knowledge scheme that cryprographically augments coins for this purpose. Our scheme enables buyers to prove to be of sufficient age for a particular transaction without disclosing it. Our modification preserves the privacy a作者: 難聽的聲音 時間: 2025-3-27 04:33 作者: barium-study 時間: 2025-3-27 06:16 作者: 閑逛 時間: 2025-3-27 10:58
One Vote Is Enough for?Analysing Privacyensuring the security of the cryptographic protocols used in e-voting is of paramount importance. However, the security analysis of this type of protocols raises a number of challenges, and they are often out of reach of existing verification tools..In this paper, we study ., a central security prop作者: MAG 時間: 2025-3-27 14:23 作者: uveitis 時間: 2025-3-27 19:32
XSPIR: Efficient Symmetrically Private Information Retrieval from?Ring-LWEas been retrieved. Symmetrically Private Information Retrieval (SPIR) additionally protects the privacy of the data, requiring that the client obtains only its desired entry, and no information on other data entries..In recent years, considerable effort has been expanded towards making PIR practical作者: Offstage 時間: 2025-3-28 01:41
Scaling up?GAEN Pseudorandom Processes: Preparing for?a?More Extensive Pandemicorldwide to fight the COVID-19 pandemic spread via contact tracing. Among these systems, many rely on the BLE based Google-Apple Exposure Notification (GAEN) API (for iPhones and Android systems)..We assert that it is now the time to investigate how to deal with scale issues, assuming the next pande作者: prosperity 時間: 2025-3-28 03:42 作者: immunity 時間: 2025-3-28 09:35
Spatial Encryption Revisited: From Delegatable Multiple Inner Product Encryption and?Moreince its introduction, SE has been shown as a versatile and elegant tool for implementing many other important primitives such as (Hierarchical) Identity-based Encryption ((H)IBE), Broadcast (H)IBE, Attribute-based Encryption, and Forward-secure cryptosystems..This paper revisits SE toward a more co作者: 談判 時間: 2025-3-28 10:24
Public Key Authenticated Encryption with Keyword Search from LWEl. proposed the public key authenticated encryption with keyword search (PAEKS), where the sender not only encrypts a keyword, but also authenticates it. To further resist against quantum attacks, Liu et al. proposed a generic construction of PAEKS and the first quantum-resistant PAEKS instantiation作者: Mendacious 時間: 2025-3-28 15:52
An Efficient Query Recovery Attack Against a?Graph Encryption Schemery attack against this GKT scheme when the adversary is given the original graph together with the leakage of certain subsets of queries. Our attack falls within the security model used by Ghosh et al., and is the first targeting schemes supporting shortest path queries. Our attack uses classical gr作者: albuminuria 時間: 2025-3-28 19:59
Conference proceedings 20222, which took place in September 2022. The conference took place in Copenhagen, Denmark, in a hybrid mode..The 104 full papers and 6 poster papers presented in these proceedings were carefully reviewed and selected from 562 submissions. They were organized in topical sections as follows:.Part I: Blo作者: homeostasis 時間: 2025-3-29 02:15
0302-9743 SORICS 2022, which took place in September 2022. The conference took place in Copenhagen, Denmark, in a hybrid mode..The 104 full papers and 6 poster papers presented in these proceedings were carefully reviewed and selected from 562 submissions. They were organized in topical sections as follows:.P作者: 名字的誤用 時間: 2025-3-29 04:40
Zero-History Confidential Chains with?Zero-Knowledge Contracts: A New Normal for?Decentralized Ledgeropose two Origami confidential chains, classical and quantum-safe, with zero-knowledge contracts. This paper demonstrates that zero-history blockchains should be the new normal blockchain structure due to their high scalability even with post-quantum settings and zero-knowledge contracts.作者: Metamorphosis 時間: 2025-3-29 09:28 作者: commodity 時間: 2025-3-29 12:15 作者: Conflict 時間: 2025-3-29 18:40 作者: 帶子 時間: 2025-3-29 20:11
Sheila Black,Gaynell M. Simpsonropose two Origami confidential chains, classical and quantum-safe, with zero-knowledge contracts. This paper demonstrates that zero-history blockchains should be the new normal blockchain structure due to their high scalability even with post-quantum settings and zero-knowledge contracts.作者: motivate 時間: 2025-3-30 00:43 作者: 攤位 時間: 2025-3-30 06:19 作者: mechanism 時間: 2025-3-30 11:38 作者: Mangle 時間: 2025-3-30 12:37
One Vote Is Enough for?Analysing Privacy mount an attack. Our result applies on a number of case studies including several versions of Helios, Belenios, JCJ/Civitas, and Prêt-à-Voter. For some of these protocols, thanks to our result, we are able to conduct the analysis relying on the automatic tool ..作者: 效果 時間: 2025-3-30 19:58
Scaling up?GAEN Pseudorandom Processes: Preparing for?a?More Extensive Pandemiche systems built on top of it, therefore it can be easily adopted upon emerging needs. The techniques we suggest in this paper (called “dice and splice” and “forest from the PRF-tree”) are general and applicable to scenarios of searching values within anonymous pseudo-randomly generated sequences.作者: TRACE 時間: 2025-3-31 00:02
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233870.jpg作者: BURSA 時間: 2025-3-31 02:48
Computer Security – ESORICS 2022978-3-031-17140-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
