作者: Harpoon 時(shí)間: 2025-3-21 21:16
978-3-319-45740-6Springer International Publishing Switzerland 2016作者: 抗生素 時(shí)間: 2025-3-22 03:32 作者: innovation 時(shí)間: 2025-3-22 05:01 作者: 刀鋒 時(shí)間: 2025-3-22 11:09
Clotting Around Catheters and Devices,p cipher execution, many implementations rely on pre-computed lookup tables, which makes them vulnerable to cache-timing attacks on modern processors. For . attacks, the overall execution time of a cipher is sufficient to recover the secret key. Testing cryptographic software on actual hardware is c作者: IRS 時(shí)間: 2025-3-22 16:00
Erika Leemann Price,Tracy Minichiello M.D.. A common flaw that was discovered by the security researchers was that the votes were stored sequentially according to the time they were cast, which allows an attacker to break the anonymity of the voters. Subsequent research pointed out the connection between vote storage and the privacy propert作者: IRS 時(shí)間: 2025-3-22 17:16 作者: 言行自由 時(shí)間: 2025-3-23 00:04 作者: 不能約 時(shí)間: 2025-3-23 03:19 作者: glomeruli 時(shí)間: 2025-3-23 06:48
https://doi.org/10.1007/978-1-4612-6164-3 form suitable for applying known protocols. We propose a new system that can securely execute . with no special annotations. Our system allows programmers to use a language of their choice to express their programs, together with any off-the-shelf compiler to MIPS; it can be used for secure computa作者: 大雨 時(shí)間: 2025-3-23 13:36
Timothy McCartney,Michael Neville the processed data to the service providers. This leads users to put less trust in service providers and be more reluctant to share data. Transparency logging is about service providers continuously logging descriptions of the data processing on their users’ data, where each description is intended作者: 輕率的你 時(shí)間: 2025-3-23 15:13 作者: 拖網(wǎng) 時(shí)間: 2025-3-23 19:24
Physiology of Olivocochlear Efferents,ming increasingly popular as a key part of the security culture of organizations. However, bug-bounty programs can be riddled with myriads of invalid vulnerability-report submissions, which are partially the result of misaligned incentives between white hats and organizations. To further improve the作者: Gourmet 時(shí)間: 2025-3-24 02:06 作者: 一夫一妻制 時(shí)間: 2025-3-24 03:38 作者: 縮影 時(shí)間: 2025-3-24 08:05
Soil Productivity and Nutrition,ves this requirement by pre-computing all encrypted ballots before the election using random factors that will later cancel out and allow the public to verify the tally after the election. While the removal of tallying authorities significantly simplifies election management, the pre-computation of 作者: 碎片 時(shí)間: 2025-3-24 11:06 作者: UTTER 時(shí)間: 2025-3-24 18:23 作者: 不可比擬 時(shí)間: 2025-3-24 19:23 作者: malapropism 時(shí)間: 2025-3-24 23:51
Towards Efficient Evaluation of a Time-Driven Cache Attack on Modern Processorsp cipher execution, many implementations rely on pre-computed lookup tables, which makes them vulnerable to cache-timing attacks on modern processors. For . attacks, the overall execution time of a cipher is sufficient to recover the secret key. Testing cryptographic software on actual hardware is c作者: Mystic 時(shí)間: 2025-3-25 03:57
More Practical and Secure History-Independent Hash Tables. A common flaw that was discovered by the security researchers was that the votes were stored sequentially according to the time they were cast, which allows an attacker to break the anonymity of the voters. Subsequent research pointed out the connection between vote storage and the privacy propert作者: Encoding 時(shí)間: 2025-3-25 09:58
On Manufacturing Resilient Opaque Constructs Against Static Analysiss based the resilience of these primitives on a poorly defined reduction to a known .-complete problem. There has been little scrutiny of the adversarial model and little discussion of how to generate instances that are always hard. In this paper, we offer what we believe to be the first complete al作者: 巧辦法 時(shí)間: 2025-3-25 12:20 作者: Peculate 時(shí)間: 2025-3-25 15:51
Compiling Low Depth Circuits for Practical Secure Computationr MPC from functionality descriptions in a high-level language. Previous compilers focused on the creation of size-minimal circuits. However, many MPC protocols, such as GMW and SPDZ, have a round complexity that is dependent on the circuit’s depth. When deploying these protocols in real world netwo作者: 語(yǔ)源學(xué) 時(shí)間: 2025-3-25 20:28 作者: Chauvinistic 時(shí)間: 2025-3-26 03:19 作者: 異端邪說(shuō)2 時(shí)間: 2025-3-26 08:18
Secure Logging Schemes and Certificate Transparencyhat have been fraudulently issued for their domain. . is a recent standard by the Internet Engineering Task Force (IETF) that aims to construct public logs of all certificates issued by CAs, making it easier for domain owners to monitor for fraudulently issued certificates. To avoid relying on trust作者: 外形 時(shí)間: 2025-3-26 12:15
Banishing Misaligned Incentives for Validating Reports in Bug-Bounty Platformsming increasingly popular as a key part of the security culture of organizations. However, bug-bounty programs can be riddled with myriads of invalid vulnerability-report submissions, which are partially the result of misaligned incentives between white hats and organizations. To further improve the作者: 首創(chuàng)精神 時(shí)間: 2025-3-26 14:35
Efficient Numerical Frameworks for Multi-objective Cyber Security Planning of implementation, (2)?negative side-effects of cyber-security controls (indirect costs), and (3)?mitigation of the cyber-security risk. We consider “passive” and “reactive” threats, the former representing the case where attack attempts are independent of the defender’s plan, the latter, where att作者: Incumbent 時(shí)間: 2025-3-26 19:27
On Bitcoin Security in the Presence of Broken Cryptographic Primitivesforever: increased computational power and advanced cryptanalysis cause primitives to break frequently, and motivate the development of new ones. It is therefore crucial for maintaining trust in a cryptocurrency to anticipate such breakage..We present the first systematic analysis of the effect of b作者: facetious 時(shí)間: 2025-3-26 23:19
DRE-ip: A Verifiable E-Voting Scheme Without Tallying Authoritiesves this requirement by pre-computing all encrypted ballots before the election using random factors that will later cancel out and allow the public to verify the tally after the election. While the removal of tallying authorities significantly simplifies election management, the pre-computation of 作者: Processes 時(shí)間: 2025-3-27 02:27
When Are Three Voters Enough for Privacy Properties?otocols, which aim at authentication or key exchange. One of the reasons is that they need to be secure for an arbitrary number of malicious voters. In this paper we identify a class of voting protocols for which only a small number of agents needs to be considered: if there is an attack on vote pri作者: 輕推 時(shí)間: 2025-3-27 08:04 作者: 槍支 時(shí)間: 2025-3-27 13:10 作者: landmark 時(shí)間: 2025-3-27 13:42 作者: paroxysm 時(shí)間: 2025-3-27 21:10 作者: aggressor 時(shí)間: 2025-3-28 00:09 作者: 描繪 時(shí)間: 2025-3-28 06:10
Microphthalmia and Other Considerations,ion techniques and implement these in the existing CBMC-GC compiler. Our experiments show significant depth reductions over hand-optimized constructions (for some applications up?to 2.5.), while maintaining a circuit size that is competitive with size-minimizing compilers. Evaluating exemplary funct作者: 浮雕寶石 時(shí)間: 2025-3-28 08:25
Timothy McCartney,Michael Nevilleervices) through the use of an authenticated data structure named Balloon. Finally, our publicly available prototype implementation shows greatly improved performance with respect to related work and competitive performance for more data-intensive settings like secure logging.作者: white-matter 時(shí)間: 2025-3-28 11:42 作者: habile 時(shí)間: 2025-3-28 15:38 作者: 江湖騙子 時(shí)間: 2025-3-28 22:28
Soil Productivity and Nutrition,thorities, similar to DRE-i, but with a significantly stronger guarantee on voter privacy. In the event that the voting machine is fully compromised, the assurance on tallying integrity remains intact and the information leakage is limited to the minimum: only the partial tally at the time of compro作者: 侵略者 時(shí)間: 2025-3-29 01:56
,Rule and Rebellion (1826–1871), of our results on several case studies, including different versions of Helios and Prêt-à-Voter, as well as the JCJ protocol. For some of these protocols we can use the ProVerif tool to provide the first formal proofs of privacy for an unbounded number of voters.作者: 小官 時(shí)間: 2025-3-29 06:58
,Rule and Rebellion (1826–1871),ent smart contracts using the standard transactions only?” We answer this question affirmatively, by constructing efficient Zero-Knowledge Contingent Payment protocol for a large class of NP-relations. This includes the relations for which efficient sigma protocols exist. In particular, our protocol作者: Antagonist 時(shí)間: 2025-3-29 10:54
Towards Efficient Evaluation of a Time-Driven Cache Attack on Modern Processorsne their corresponding attacks. As an additional benefit, combined attacks simplify a comprehensive evaluation of cryptographic software across multiple different processors. We finally formulate practical evaluation suggestions based on the results of our case study.作者: infatuation 時(shí)間: 2025-3-29 13:35
More Practical and Secure History-Independent Hash Tableshe data structures. In this work, we present and analyze an efficient hash table data structure that simultaneously achieves the following properties:.To our knowledge, our hash table construction is the first data structure that combines history-independence and protection against a form of timing 作者: paleolithic 時(shí)間: 2025-3-29 18:37 作者: Narrative 時(shí)間: 2025-3-29 21:53 作者: cushion 時(shí)間: 2025-3-30 03:44
Compiling Low Depth Circuits for Practical Secure Computationion techniques and implement these in the existing CBMC-GC compiler. Our experiments show significant depth reductions over hand-optimized constructions (for some applications up?to 2.5.), while maintaining a circuit size that is competitive with size-minimizing compilers. Evaluating exemplary funct作者: ALTER 時(shí)間: 2025-3-30 07:36 作者: Condense 時(shí)間: 2025-3-30 08:56
Secure Logging Schemes and Certificate Transparencye security properties. We consider two classes of security goals: those involving security against a malicious logger attempting to present different views of the log to different parties or at different points in time, and those involving security against malicious monitors who attempt to frame an 作者: 辯論 時(shí)間: 2025-3-30 14:00 作者: nauseate 時(shí)間: 2025-3-30 18:14
DRE-ip: A Verifiable E-Voting Scheme Without Tallying Authoritiesthorities, similar to DRE-i, but with a significantly stronger guarantee on voter privacy. In the event that the voting machine is fully compromised, the assurance on tallying integrity remains intact and the information leakage is limited to the minimum: only the partial tally at the time of compro作者: Admire 時(shí)間: 2025-3-30 21:03
When Are Three Voters Enough for Privacy Properties? of our results on several case studies, including different versions of Helios and Prêt-à-Voter, as well as the JCJ protocol. For some of these protocols we can use the ProVerif tool to provide the first formal proofs of privacy for an unbounded number of voters.作者: GIBE 時(shí)間: 2025-3-31 02:21
Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scriptsent smart contracts using the standard transactions only?” We answer this question affirmatively, by constructing efficient Zero-Knowledge Contingent Payment protocol for a large class of NP-relations. This includes the relations for which efficient sigma protocols exist. In particular, our protocol作者: 斜坡 時(shí)間: 2025-3-31 08:45
https://doi.org/10.1007/978-1-4612-6164-3d universal circuits for the execution of a MIPS CPU in each instruction step. We also explore various optimizations based on an offline analysis of the MIPS code to be executed, in order to minimize the overhead of executing each instruction while still maintaining security.
