作者: Mirage 時間: 2025-3-21 23:50
Aron Gurwitsch,Jorge García-Gómezpair. These primitives enable fair and verifiable pseudorandom lotteries, essential in proof-of-stake blockchains such as Algorand and Cardano, and are being used to secure billions of dollars of capital. As a result, there is an ongoing IRTF effort to standardize VRFs, with a proposed ECVRF based o作者: thyroid-hormone 時間: 2025-3-22 04:25 作者: 松雞 時間: 2025-3-22 08:25
On the Intentionality of Consciousness,tivated by trade-offs in the characteristics of post-quantum algorithms. Prior proofs of security of . and its variant . have been hand-written proofs in the reductionist model under computational assumptions. In this paper, we present computer-verified symbolic analyses of . and . using two distinc作者: 爭吵加 時間: 2025-3-22 12:43
R. D?pel,K. Gailer,E. P. Wignerrecise knowledge about microarchitectural properties. While a native attacker can easily query many of these properties, the sandboxed environment in browsers prevents this. In this paper, we present six side-channel-related benchmarks that reveal CPU properties, such as cache sizes or cache associa作者: 手工藝品 時間: 2025-3-22 15:45 作者: 手工藝品 時間: 2025-3-22 20:25
https://doi.org/10.1007/978-1-4613-8928-6s on behalf of users. This introduces challenges when the account owner wants to delegate certain rights to a proxy user, such as to access their accounts or perform actions on their behalf, as delegation must not undermine the decentralisation, unlinkability, and attestation properties provided by 作者: 侵略主義 時間: 2025-3-22 23:56 作者: Hyaluronic-Acid 時間: 2025-3-23 05:26
J. Richard Büchi’s Doctoral Studentsentations, leading to ambiguity that can be abused by attackers. We measure agreement between widely-used URL parsers and find that each has made design decisions that deviate from parsing standards, creating a fractured implementation space where assumptions of uniform interpretation are unreliable作者: Endometrium 時間: 2025-3-23 08:36 作者: 榮幸 時間: 2025-3-23 12:57
The Collected Works of L. S. Vygotskyrawback of this channel is that it heavily relies on simultaneous multi-threading, which can be absent from some CPUs or simply disabled by the OS..In this paper, we present ., which does not require SMT. It exploits sub-optimal scheduling to execution ports for instruction-level parallelization. As作者: TIGER 時間: 2025-3-23 14:16
The Collected Works of L. S. Vygotskyes can be built. The TCB is secure by definition, and it is typically implemented through hardened hardware components, which ensure that their secret data cannot be compromised. In this paper, we propose and investigate a two-tier TCB architecture that benefits both from a small hardened ‘minimal’ 作者: 不能逃避 時間: 2025-3-23 18:50 作者: ANTIC 時間: 2025-3-24 01:57
Methods of Studying Higher Mental Functionsemi-honest adversary setting. In SecureBiNN, three participants hold input data and model parameters in secret sharing form, and execute secure computations to obtain secret shares of prediction result without disclosing their input data, model parameters and the prediction result. SecureBiNN perfor作者: FLAIL 時間: 2025-3-24 06:02
Robert W. Rieber,Aaron S. Cartoncret or Boolean sharing, and garbled circuits. In this paper, we design a new class of multi-party computation protocols which themselves are composed out of two-party protocols. We integrate both types of compositions, compositions of fully homomorphic encryption and garbled circuits with compositi作者: adumbrate 時間: 2025-3-24 10:29 作者: acrophobia 時間: 2025-3-24 11:47
https://doi.org/10.1007/978-3-031-17143-7artificial intelligence; authentication; computer crime; computer hardware; computer networks; computer s作者: 得意牛 時間: 2025-3-24 18:05
978-3-031-17142-0The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: cruise 時間: 2025-3-24 19:00 作者: 沙草紙 時間: 2025-3-25 01:10
A Formal Analysis of?the?FIDO2 Protocolsweb. We present a formal security analysis of the FIDO2 protocols. We extend the previously presented formalization of the security assumptions and goals of FIDO with FIDO2 specific requirements. We develop a formal model that considers both the CTAP2 and WebAuthn in FIDO2 as a whole. Our formal ana作者: UNT 時間: 2025-3-25 03:43
A Composable Security Treatment of?ECVRF and?Batch Verificationspair. These primitives enable fair and verifiable pseudorandom lotteries, essential in proof-of-stake blockchains such as Algorand and Cardano, and are being used to secure billions of dollars of capital. As a result, there is an ongoing IRTF effort to standardize VRFs, with a proposed ECVRF based o作者: 存在主義 時間: 2025-3-25 08:47 作者: 凹槽 時間: 2025-3-25 13:59
A Tale of?Two Models: Formal Verification of?, via?Tamarintivated by trade-offs in the characteristics of post-quantum algorithms. Prior proofs of security of . and its variant . have been hand-written proofs in the reductionist model under computational assumptions. In this paper, we present computer-verified symbolic analyses of . and . using two distinc作者: Intrepid 時間: 2025-3-25 19:44
Browser-Based CPU Fingerprintingrecise knowledge about microarchitectural properties. While a native attacker can easily query many of these properties, the sandboxed environment in browsers prevents this. In this paper, we present six side-channel-related benchmarks that reveal CPU properties, such as cache sizes or cache associa作者: pineal-gland 時間: 2025-3-25 20:05
Polymorphic Protocols at?the?Example of?Mitigating Web Botsne games or social media. Bots impact the revenue of service providers and can damage society by spreading false information. While few bots are usually not a problem, a large number is. Thus, we focus on bots that directly use a service’s application protocol, as they are the most efficient and eas作者: gusher 時間: 2025-3-26 02:22
Unlinkable Delegation of?WebAuthn Credentialss on behalf of users. This introduces challenges when the account owner wants to delegate certain rights to a proxy user, such as to access their accounts or perform actions on their behalf, as delegation must not undermine the decentralisation, unlinkability, and attestation properties provided by 作者: 行乞 時間: 2025-3-26 04:19
Large Scale Analysis of?DoH Deployment on?the?Internetfrom monopolisation of surveillance to lost visibility by network administrators and security providers. More importantly, it is a novel security business. Software products and organisations depend on users choosing well-known and trusted DoH resolvers. However, there is no comprehensive study on t作者: Freeze 時間: 2025-3-26 10:02 作者: synovitis 時間: 2025-3-26 15:52
Exploring the?Characteristics and?Security Risks of?Emerging Emoji Domain Names), little has been done to understand its development status and security issues. In this paper, we identify 54,403 emoji domains from 1,366 TLD zone files and a large-scale passive DNS dataset. And then, we correlate them with auxiliary data sources like domain WHOIS records. It allowed us to condu作者: 思考而得 時間: 2025-3-26 17:50
CPU Port Contention Without SMTrawback of this channel is that it heavily relies on simultaneous multi-threading, which can be absent from some CPUs or simply disabled by the OS..In this paper, we present ., which does not require SMT. It exploits sub-optimal scheduling to execution ports for instruction-level parallelization. As作者: 狂熱文化 時間: 2025-3-26 21:32
Protocols for?a?Two-Tiered Trusted Computing Basees can be built. The TCB is secure by definition, and it is typically implemented through hardened hardware components, which ensure that their secret data cannot be compromised. In this paper, we propose and investigate a two-tier TCB architecture that benefits both from a small hardened ‘minimal’ 作者: Ankylo- 時間: 2025-3-27 04:59
Using Memristor Arrays as?Physical Unclonable Functionsstor cells when an excitation signal is applied to their input. First, the cells are identified by decomposing the signal response into different frequencies using the discrete Fourier transformation and evaluating the absolute sum of errors. This approach provides a maximum accuracy of 96% and F1-s作者: 廢除 時間: 2025-3-27 08:44
SecureBiNN: 3-Party Secure Computation for?Binarized Neural Network Inferenceemi-honest adversary setting. In SecureBiNN, three participants hold input data and model parameters in secret sharing form, and execute secure computations to obtain secret shares of prediction result without disclosing their input data, model parameters and the prediction result. SecureBiNN perfor作者: LINE 時間: 2025-3-27 13:10
Mixed-Technique Multi-Party Computations Composed of?Two-Party Computationscret or Boolean sharing, and garbled circuits. In this paper, we design a new class of multi-party computation protocols which themselves are composed out of two-party protocols. We integrate both types of compositions, compositions of fully homomorphic encryption and garbled circuits with compositi作者: 亞麻制品 時間: 2025-3-27 14:24 作者: Inflamed 時間: 2025-3-27 21:42
A Tale of?Two Models: Formal Verification of?, via?Tamarinalso uncovered some inconsistencies in the previous model. In the second analysis, we present a novel Tamarin model of ., which closely follows the multi-stage key exchange security model from prior pen-and-paper proofs of .. The second approach is further away from the wire-format of the protocol s作者: 補充 時間: 2025-3-28 00:44 作者: archaeology 時間: 2025-3-28 06:05 作者: Trabeculoplasty 時間: 2025-3-28 09:06 作者: 省略 時間: 2025-3-28 11:20 作者: orthodox 時間: 2025-3-28 16:31
Exploring the?Characteristics and?Security Risks of?Emerging Emoji Domain Namestes. Besides, emoji domains are also leveraged to provide disposable email services, pornography or gambling pages, and even the distribution of malware. On the other hand, the concern is that the community still lacks best security practices in supporting and parsing emoji domains. Through empirica作者: Breach 時間: 2025-3-28 20:14
SecureBiNN: 3-Party Secure Computation for?Binarized Neural Network InferenceCIFAR-10 dataset an accuracy of 81.5%, with communication cost of 16.609MB and runtime of 0.527s/3.447s in the LAN/WAN settings. More evaluations on real-world datasets are also performed and other concrete comparisons with state-of-the-art are presented as well.作者: 衣服 時間: 2025-3-29 02:10
Mixed-Technique Multi-Party Computations Composed of?Two-Party Computationsrivate set disjointness. This scheme enjoys lower communication complexity than a solution based on generic multi-party computation and lower computation cost than fully homomorphic encryption. So, our design is more suitable for deployments in wide-area networks, such as the Internet, with many par作者: Generator 時間: 2025-3-29 04:36 作者: Dendritic-Cells 時間: 2025-3-29 09:44
Aron Gurwitsch,Jorge García-Gómeza VRF with batch-verification capability, and propose modifications to ECVRF that allow for this feature. We again prove that our proposal UC-realizes the desired functionality. Finally, we provide a performance analysis showing that verification can yield a factor-two speedup for batches with 1024 作者: CARK 時間: 2025-3-29 14:22 作者: temperate 時間: 2025-3-29 18:18 作者: needle 時間: 2025-3-29 22:39 作者: opinionated 時間: 2025-3-30 00:01
https://doi.org/10.1007/978-1-4613-8928-6d 4.8 times in the period 2021–2022, (ii) the number of organisations providing DoH services has doubled, and (iii) the number of DoH resolvers in 2022 is 28 times larger than the number of well-known DoH resolvers by the community. Moreover, 94% of the public DoH resolvers on the Internet are unkno作者: thrombus 時間: 2025-3-30 05:02 作者: 比賽用背帶 時間: 2025-3-30 09:41
The Collected Works of L. S. Vygotskytes. Besides, emoji domains are also leveraged to provide disposable email services, pornography or gambling pages, and even the distribution of malware. On the other hand, the concern is that the community still lacks best security practices in supporting and parsing emoji domains. Through empirica作者: AGOG 時間: 2025-3-30 13:08 作者: 針葉類的樹 時間: 2025-3-30 20:15
Robert W. Rieber,Aaron S. Cartonrivate set disjointness. This scheme enjoys lower communication complexity than a solution based on generic multi-party computation and lower computation cost than fully homomorphic encryption. So, our design is more suitable for deployments in wide-area networks, such as the Internet, with many par作者: 上坡 時間: 2025-3-30 21:31
0302-9743 ures; IoT security; applications;.Part III: Formal analysis; Web security; hardware security; multiparty computation; ML techniques; cyber-physical systems security; network and software security; posters.978-3-031-17142-0978-3-031-17143-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 可能性 時間: 2025-3-31 01:59
R. D?pel,K. Gailer,E. P. Wignerso allows identifying the CPU vendor with an accuracy of 97.5%, and the microarchitecture and CPU model each with an accuracy of above 60%. The benchmarks are unaffected by current side-channel and browser fingerprinting mitigations, and can thus be used for more targeted attacks and to increase the entropy in browser fingerprinting.
