In this paper we study one-round key-agreement protocols analogous to Merkle’s puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutation oracle n times and upon their queries and communication, they both output the same key with high probability. We prove that Eve can always break such a protocol by querying the oracle O(n) times. The long-time unpr...

In this cross-cultural study, we primarily aim to present research-based evidence to examine the main gender characteristics associated with socialization. Using the symbolic interaction theory and the socialization theory, this cross-cultuural analysis particularly explores the construction and representation of gender identity through educational systems. The fields of this stu...

Fluid turbulence is undoubtedly a complex phenomenon, but the relation between the fundamental laws and the emergence of large-scale coherent eddies from differential interactions in a random background has remained elusive. Such a connection is attempted in this paper. The key analytical step is to express the Navier-Stokes equations in the Hermitian wavelet representation, which adds one inde...

Here we study a weakness of the RC4 Key Scheduling Algorithm (KSA) that has already been noted by Mantin and Mironov. Consider the RC4 permutation S of N (usually 256) bytes and denote it by SN after the KSA. Under reasonable assumptions we present a simple proof that each permutation byte after the KSA is significantly biased (either positive or negative) towards many values in the range 0, . ...

We present a new two-party attribute-based key agreement protocol that is secure without the random oracle model in groups equipped with a bilinear map. The attribute-based key agreement scheme is one type of the identity-based key agreement scheme, in which the identity can be viewed as a set of descriptive attributes. These kinds of schemes provide some new properties, such as hiding the iden...

Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help of an arbitrator which is called in only when a dispute happens between the two parties. In almost all the previous work on OFE, after obtaining a partial signature from the signer, the verifier can present it to others...

We introduce the first secure Certificateless Public Key Encryption (CL-PKE) scheme against a malicious Key Generation Center (KGC) in the standard model. Recently, Au et al. [3] pointed out that the previous security models for CL-PKE schemes cannot guarantee the security against a malicious KGC. They also showed that although some schemes are secure against malicious KGC, they require the ran...