Titlebook: Information Security and Privacy; 4th Australasian Con Josef Pieprzyk,Rei Safavi-Naini,Jennifer Seberry Conference proceedings 1999 Springe

deriver

柱廊

Conference Key Agreement from Secret Sharingn. To start a new conference all principals have to be active and broadcast their shares. If the conference goes ahead, all principals are sure that all principals are present and alive. The paper is concluded with a discussion about possible modifications and extensions of the protocol.

GUILE

On the Security of an RSA Based Encryption Scheme authentication capability. By means of probabilistic encoding, the scheme achieves semantic security and plaintext awareness in the standard (i.e. non random oracle) model under the assumption of a collision-resistant hash function and the factorization intractability of the receiver’s modulus.

Dendritic-Cells

Generalised Cycling Attacks on RSA and Strong RSA Primesntroduce some new .. These attacks work . the knowledge of . and .. Therefore, these attacks can be used as factorisation algorithms. We also translate these attacks to elliptic curves. For this case we call these attacks .. Finally, we review criteria that a strong RSA prime must satisfy.

不可接触

Companion Viruses and the Macintosh: Threats and Countermeasuresntosh viruses. Following an examination of the details of our attack, we discuss generic countermeasures to a virus using the attack, one of which in particular appears very effective against the attack.

STALE

Enumeration of Correlation Immune Boolean Functionsssary conditions and use these to derive better upper bounds. Further, bounds are obtained for the set of functions which satisfy the four conditions of correlation immunity, balancedness, nondegeneracy and nonaffinity. Our work clearly highlights the difficulty of exactly enumerating the set of correlation immune functions.

POWER

ALT

Inversion Attack and Branchingnction. Both theory and systematic experiments conducted show that its time complexity remains close to 2., . being the input memory size, while the additional memory space required is relatively small for most the filter functions.

使满足

Fail-Stop Threshold Signature Schemes Based on Elliptic Curvesobtain a threshold signature scheme. The threshold signature scheme has a cheater detection property and allows the combiner to detect a sender who is submitting false shares. We will show that our fail-stop signature scheme works in the two commonly used models of signature schemes, with or without a trusted authority.

反复拉紧

On ,-Permutation Protection Scheme against Modification Attack. In this paper, we demonstrate how it can be done, and propose a revised .-permutation scheme that would close the loop-hole. It is also proved that the probability of breaking the revised scheme will be 1/2. for a .-bit key.