Titlebook: Information and Communications Security; 10th International C Liqun Chen,Mark D. Ryan,Guilin Wang Conference proceedings 2008 Springer-Verl

implicate

書(shū)目名稱Information and Communications Security影響因子(影響力)




書(shū)目名稱Information and Communications Security影響因子(影響力)學(xué)科排名




書(shū)目名稱Information and Communications Security網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Information and Communications Security網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Information and Communications Security被引頻次




書(shū)目名稱Information and Communications Security被引頻次學(xué)科排名




書(shū)目名稱Information and Communications Security年度引用




書(shū)目名稱Information and Communications Security年度引用學(xué)科排名




書(shū)目名稱Information and Communications Security讀者反饋




書(shū)目名稱Information and Communications Security讀者反饋學(xué)科排名

Lobotomy

A Novel Solution for End-to-End Integrity Protection in Signed PGP Maile email header is unauthentic. DKIM protects specified header fields, but only between the sending server and the receiver. These lead to possible impersonation attacks and profiling of the email communication, and encourage spam and phishing activities. In this paper we propose an approach to exten

1分開(kāi)

Unclonable Lightweight Authentication Schemeotocol [1] which utilizes Physically Unclonable Functions (PUFs). We reduce the security of (HB+PUF) in the active attacker model to solving the LPN problem. The proposed scheme enjoys strong tamper-resilience due to the PUF properties. We present a proof of concept implementation for the proposed p

FACET

SPALL

Access with Fast Batch Verifiable Anonymous Credentialss on one or more resources, whereby interactions involving the same user are unlinkable by the resource guard. This paper proposes three fast batch verifiable anonymous credential schemes. With all three schemes, the user can arbitrarily choose a portion of his access rights to prove possession of c

sundowning

Quantifying Timing Leaks and Cost Optimisatione probability of the values of low variables. We then show how to measure the security of a program with respect to this notion via a computable estimate of the timing leakage and use this estimate for cost optimisation.

蛛絲

Method for Detecting Vulnerability to Doubling Attacksan be applied to a binary double-and-add algorithm in a scalar multiplication (or a multiply-and-square algorithm in a modular exponentiation). The doubling attack is very powerful because it requires just two queries to the device to find the secret key. The original doubling attack broke the binar

技術(shù)

孤獨(dú)無(wú)助

Key Recovery Attack on Stream Cipher Mir-1 Using a Key-Dependent S-Box2., meaning that the secret key cannot be recovered or that the Mir-1 output sequence cannot be distinguished from a truly random number sequence more efficiently than an exhaustive search. At SASC 2006, however, a distinguishing attack on Mir-1 was proposed making use of vulnerabilities in Mir-1 in

我怕被刺穿