We explore in this chapter questions of existence and uniqueness for solutions to stochastic differential equations and offer a study of their properties. This endeavor is really a study of diffusion processes. Loosely speaking, the term diffusion is attributed to a Markov process which has continuous sample paths and can be characterized in terms of its infinitesimal generator.

Stochastic Differential Equations

Journal of the ACM

This document describes the Secure Real-time Transport Protocol (SRTP), a profile of the Real-time Transport Protocol (RTP), which can provide confidentiality, message authentication, and replay protection to the RTP traffic and to the control traffic for RTP, the Real-time Transport Control Protocol (RTCP).

/pdf/the-secure-real-time-transport-protocol-srtp-3rvxgkjhxk.pdf

The Secure Real-time Transport Protocol (SRTP)

A privacy preserving association rule mining algorithm was introducedThis algorithm preserved privacy of individual values by computing scalar productMeanwhile the algorithm of computing scalar product was given and the security was analyzed

Privacy preserving association rule mining in vertically partitioned data

Introduction to finite fields and their applications: Preface

Constructing PEKS schemes secure against keyword guessing attacks is possible

Many arbitrated quantum signature schemes implemented with the help of a trusted third party have been developed up to now. In order to guarantee unconditional security, most of them take advantage of the optimal quantum one-time encryption based on Pauli operators. However, in this paper we point out that the previous schemes provide security only against a total break attack and show in fact that there exists an existential forgery attack that can validly modify the transmitted pair of message and signature. In addition, we also provide a simple method to recover security against the proposed attack.

Security problem on arbitrated quantum signature schemes

The main property of the self-healing key distribution scheme is that users are capable of recovering lost group keys on their own, without requesting additional transmission from the group manager. In this paper, we propose a new self-healing key distribution scheme, which is optimal in terms of user memory storage and more efficient in terms of communication complexity than the previous results.

An efficient key distribution scheme with self-healing property

The rectangle attack and the related-key attack on block ciphers are well-known to be very powerful. In this paper we combine the rectangle attack with the related-key attack. Using this combined attack we can attack the SHACAL-1 cipher with 512-bit keys up to 59 out of its 80 rounds. Our 59-round attack requires a data complexity of 2149.72 chosen plaintexts and a time complexity of 2498.30 encryptions, which is faster than exhaustive search.

The Related-Key Rectangle Attack – Application to SHACAL-1

This paper presents a new bit-parallel multiplier for the finite field GF(2/sup m/) defined by an irreducible all-one polynomial. In order to reduce the complexity of the multiplier, we introduce a redundant representation and use the well-known multiplication method proposed by Karatsuba. The main idea is to combine the redundant representation and the Karatsuba method to design an efficient bit-parallel multiplier. As a result, the proposed multiplier requires about 25 percent fewer AND/XOR gates than the previously proposed multipliers using an all-one polynomial, while it has almost the same time delay as the previously proposed ones.

Dowon Hong

Papers

Constructing PEKS schemes secure against keyword guessing attacks is possible

Security problem on arbitrated quantum signature schemes

An efficient key distribution scheme with self-healing property

The Related-Key Rectangle Attack – Application to SHACAL-1

Low complexity bit-parallel multiplier for GF(2/sup m/) defined by all-one polynomials using redundant representation