作者: Detain 時(shí)間: 2025-3-21 22:58
0302-9743 osium on Research in Computer Security, ESORICS 2015, held in Vienna, Austria, in September 2015...The 59 revised full papers presented were carefully reviewed and selected from 298 submissions. The papers address issues such as networks and Web security; system security; crypto application and atta作者: Buttress 時(shí)間: 2025-3-22 03:59 作者: Buttress 時(shí)間: 2025-3-22 07:35 作者: 蚊帳 時(shí)間: 2025-3-22 10:33
The Circular Economy in the European Unionversary’s Javascript code. We are not only able to determine which applications are running, but also specific user activities, for instance, whether the user has specific websites currently opened. The attack works on servers, personal computers and smartphones, and across the borders of virtual machines.作者: definition 時(shí)間: 2025-3-22 14:14 作者: definition 時(shí)間: 2025-3-22 19:07
https://doi.org/10.1057/9781137430038other parameters. Previously known .-protocols for LWE-related languages only achieved a noticeable or even constant knowledge error (thus requiring many repetitions of the protocol), or relied on “smudging” out the error (which necessitates working over large fields, resulting in poor efficiency).作者: insolence 時(shí)間: 2025-3-22 22:55 作者: 委派 時(shí)間: 2025-3-23 02:22 作者: 打折 時(shí)間: 2025-3-23 06:34
Computational Soundness for Interactive Primitivesexisting computational soundness result by UC-secure blind signatures. We obtain computational soundness for blind signatures in uniform bi-processes in the applied .-calculus. This enables us to verify the untraceability of Chaum’s payment protocol in ProVerif in a computationally sound manner.作者: 側(cè)面左右 時(shí)間: 2025-3-23 13:14
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Ringsother parameters. Previously known .-protocols for LWE-related languages only achieved a noticeable or even constant knowledge error (thus requiring many repetitions of the protocol), or relied on “smudging” out the error (which necessitates working over large fields, resulting in poor efficiency).作者: 改變 時(shí)間: 2025-3-23 15:09 作者: configuration 時(shí)間: 2025-3-23 19:33 作者: 軟膏 時(shí)間: 2025-3-24 02:06
Conference proceedings 2015. The papers address issues such as networks and Web security; system security; crypto application and attacks; risk analysis; privacy; cloud security; protocols and attribute-based encryption; code analysis and side-channels; detection and monitoring; authentication; policies; and applied security. ? ?.作者: 指令 時(shí)間: 2025-3-24 06:20 作者: entitle 時(shí)間: 2025-3-24 09:56 作者: Truculent 時(shí)間: 2025-3-24 14:39 作者: deforestation 時(shí)間: 2025-3-24 15:46 作者: Judicious 時(shí)間: 2025-3-24 21:38
Computer Security -- ESORICS 2015978-3-319-24174-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: peptic-ulcer 時(shí)間: 2025-3-25 01:53 作者: Neuropeptides 時(shí)間: 2025-3-25 04:30
Peter Lacy,Jessica Long,Wesley Spindlertions, browser extensions, and mobile apps. To mitigate MI attacks, we propose JSAgents, a novel and flexible approach to defeat MI attacks using DOM meta-programming. Specifically, we enforce a security policy on the DOM of the browser at a place in the markup processing chain “just before” the ren作者: 蝕刻 時(shí)間: 2025-3-25 08:30
The Circular Economy in the European Union as web messaging and web storage) and cryptographic assertions to provide decentralized login, with the intent to respect users’ privacy. It can operate in a primary and a secondary identity provider mode. While in the primary mode BrowserID runs with arbitrary identity providers, in the secondary 作者: BLAND 時(shí)間: 2025-3-25 15:12
The Circular Economy in the European Unionfortunately, existing techniques require manual designation of randomize-able data structures without guaranteeing the correctness and keep the layout unchanged at runtime. We present a system, called SALADS, that automatically translates a program to a DSSR (Data Structure Self-Randomizing) program作者: 大溝 時(shí)間: 2025-3-25 17:02 作者: 修飾 時(shí)間: 2025-3-25 20:58
The Circular Economy in the European Uniones and programs and merged by the operating system or the hypervisor. However, this enables side-channel information leakage through cache or memory access time. Therefore, it is considered harmful in public clouds today, but it is still considered safe to use in a private environment, i.e., private作者: 路標(biāo) 時(shí)間: 2025-3-26 02:55 作者: 無(wú)王時(shí)期, 時(shí)間: 2025-3-26 05:11 作者: adipose-tissue 時(shí)間: 2025-3-26 12:32
Francesco Contini,Giovan Francesco Lanzara/1, but their efficiency to crack passwords made them even more popular in the security community. While symmetric keys are generated randomly according to a uniform distribution, passwords chosen by users are in practice far from being random, as confirmed by recent leakage of databases. Unfortunat作者: HEDGE 時(shí)間: 2025-3-26 15:51 作者: 新娘 時(shí)間: 2025-3-26 19:16
The Circulation of Anti-Austerity Protestver possesses all of his data in the future. During an audit, the server must maintain full knowledge of the client’s data to pass, even though only a few blocks of the data need to be accessed. Since the first work by Juels and Kaliski, many PoR schemes have been proposed and some of them can suppo作者: 小卷發(fā) 時(shí)間: 2025-3-26 22:16
The Circulation of Anti-Austerity Protest Internet applications, but also efficient operation. The recently introduced HIMMO scheme enables lightweight and collusion-resistant identity-based key sharing in a non-interactive way, so that any pair of Internet-connected devices can securely communicate..This paper firstly reviews the HIMMO sc作者: largesse 時(shí)間: 2025-3-27 05:11
Money in the Circulation of Capital,al users to anonymously sign messages on behalf of a group of users. In ring signatures, the group, i.e. the ring, is chosen in an ad hoc manner by the signer. In group signatures, group membership is controlled by a group manager. Group signatures additionally enforce accountability by providing th作者: Debate 時(shí)間: 2025-3-27 05:18 作者: 人類(lèi)學(xué)家 時(shí)間: 2025-3-27 12:43
Luhmannization: Identity and Circulation,e literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach, a trusted Key Generation Center (KGC) periodically broadcasts a set of key updates to all (non-revoked) users through public channels, where the size作者: nerve-sparing 時(shí)間: 2025-3-27 13:36
https://doi.org/10.1057/9781137430038edge. Our scheme maps elements from the ring (or equivalently, . elements from .) to a small constant number of ring elements. We then construct .-protocols for proving, in a zero-knowledge manner, knowledge of the message contained in a commitment. We are able to further extend our basic protocol t作者: Cumulus 時(shí)間: 2025-3-27 19:24 作者: 荒唐 時(shí)間: 2025-3-28 00:53 作者: 凌辱 時(shí)間: 2025-3-28 03:19
Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the as web messaging and web storage) and cryptographic assertions to provide decentralized login, with the intent to respect users’ privacy. It can operate in a primary and a secondary identity provider mode. While in the primary mode BrowserID runs with arbitrary identity providers, in the secondary 作者: 抗原 時(shí)間: 2025-3-28 06:41
A Practical Approach for Adaptive Data Structure Layout Randomizationfortunately, existing techniques require manual designation of randomize-able data structures without guaranteeing the correctness and keep the layout unchanged at runtime. We present a system, called SALADS, that automatically translates a program to a DSSR (Data Structure Self-Randomizing) program作者: ODIUM 時(shí)間: 2025-3-28 13:18
Trustworthy Prevention of Code Injection in?Linux on Embedded Devicesich forces an untrusted Linux to obey the executable space protection policy; a memory area can be either executable or writable, but cannot be both. The executable space protection allows the MProsper’s monitor to intercept every change to the executable code performed by a user application or by t作者: 軟膏 時(shí)間: 2025-3-28 18:30 作者: discord 時(shí)間: 2025-3-28 20:01 作者: 預(yù)兆好 時(shí)間: 2025-3-29 02:40
Verifiably Encrypted Signatures: Security Revisited and a New Constructionlence class, and a signature commits to the equivalence class: anybody can transfer the signature to a new, scaled, representative..In this work, we give the first black-box construction of a public-key encryption scheme from any SPS-EQ-. satisfying a simple new property which we call perfect compos作者: charisma 時(shí)間: 2025-3-29 04:07 作者: 歹徒 時(shí)間: 2025-3-29 10:07 作者: 從屬 時(shí)間: 2025-3-29 11:55
Symmetric-Key Based Proofs of Retrievability Supporting Public Verificationver possesses all of his data in the future. During an audit, the server must maintain full knowledge of the client’s data to pass, even though only a few blocks of the data need to be accessed. Since the first work by Juels and Kaliski, many PoR schemes have been proposed and some of them can suppo作者: 滋養(yǎng) 時(shí)間: 2025-3-29 17:12 作者: 商談 時(shí)間: 2025-3-29 21:43
Short Accountable Ring Signatures Based on DDHal users to anonymously sign messages on behalf of a group of users. In ring signatures, the group, i.e. the ring, is chosen in an ad hoc manner by the signer. In group signatures, group membership is controlled by a group manager. Group signatures additionally enforce accountability by providing th作者: Melanoma 時(shí)間: 2025-3-30 01:03 作者: 厚臉皮 時(shí)間: 2025-3-30 05:19
Server-Aided Revocable Identity-Based Encryptione literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach, a trusted Key Generation Center (KGC) periodically broadcasts a set of key updates to all (non-revoked) users through public channels, where the size作者: 開(kāi)玩笑 時(shí)間: 2025-3-30 09:12
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Ringsedge. Our scheme maps elements from the ring (or equivalently, . elements from .) to a small constant number of ring elements. We then construct .-protocols for proving, in a zero-knowledge manner, knowledge of the message contained in a commitment. We are able to further extend our basic protocol t作者: visceral-fat 時(shí)間: 2025-3-30 13:40 作者: HEDGE 時(shí)間: 2025-3-30 19:01
The Circular Economy in the European Uniony provider mode of BrowserID. We do not only study authentication properties as before, but also privacy properties. During our analysis we discovered new and practical attacks that do not apply to the secondary mode: an identity injection attack, which violates a central authentication property of 作者: 包庇 時(shí)間: 2025-3-30 22:45
Money Makes the World Go ′round?y operation that can violate the desired security property. The verification of the monitor has been performed using the HOL4 theorem prover and by extending the existing formal model of the hypervisor with the formal specification of the high level model of the monitor.作者: FEIGN 時(shí)間: 2025-3-31 01:13 作者: 令人不快 時(shí)間: 2025-3-31 09:01 作者: 影響深遠(yuǎn) 時(shí)間: 2025-3-31 12:23
