Titlebook: Information Security and Cryptoloy - ICISC 2008; 11th International C Pil Joong Lee,Jung Hee Cheon Conference proceedings 2009 Springer-Ver

Incise

Instruction Set Limitation in Support of Software Diversityttacks. Such attacks require a tool to match corresponding program fragments in different, diversified program versions. The proposed technique limits the types of instructions occurring in a program to the most frequently occurring types, by replacing the infrequently used types as much as possible

Ornithologist

Non-interactive Identity-Based DNF Signature Scheme and Its Extensionsiterals of signer identities. ID-based DNF signature schemes are useful to achieve not only signer-privacy but also a multi-user access control. In this paper, we formally define a notion of a (non-interactive) ID-based DNF signature and propose the first . ID-based DNF signature schemes that are se

myalgia

MAPLE

Efficient Vote Validity Check in Homomorphic Electronic Votingin large-scale elections. In this paper two efficient vote validity check mechanisms are designed for homomorphic e-voting, both of which are much more efficient than the existing vote validity check procedures. Especially, the second vote validity check mechanism is flexible, honest-verifier zero k

Oligarchy

Secure Hardware Implementation of Non-linear Functions in the Presence of Glitchessurements of the same operation can be countered by employing masking techniques. In the presence of glitches, most of the currently known masking techniques still leak information during the computation of non-linear functions. We discuss a recently introduced masking method which is based on secre

Neutropenia

Compatriot

PALMY

堅(jiān)毅

Extended Models for Message Authenticationhelp adversaries to get some information about secret values (such like internal states) in MA-schemes, which is beyond the original models consider about, so the provable security completely lose. To fix this problem, we extend the original models for message authentication, taking the information

代理人

A Preimage Attack for 52-Step HAS-160age of step-reduced HAS-160 faster than a brute force attack, which costs 2.. The first approach is a simple application of previously known techniques, which are so-called splice-and-cut ant partial-matching techniques. This approach generates a pseudo-preimage of 48 steps of HAS-160 with a complex