In this project, we study the security properties of web-content searching by using threeparty authenticated data structure model. We present an implementation of an authenticated web crawler, a trusted program that computes a digest of a collection of web pages. This digest is later used to check the integrity of result of conjunctive keyword search queries, an important kind of query supporte...

An authenticated encryption scheme provides a mechanism of signing and encrypting simultaneously, and furthermore, the receiver can verify and decrypt the signature at the same time. Tseng et al. proposed two efficiently authenticated encryption schemes which can check the validity of the sent data before message recovery, but in fact their schemes cannot achieve completely the function. In thi...

The popular Katz-Yung compiler from CRYPTO 2003 can be used to transform unauthenticated group key establishment protocols into authenticated ones. In this paper we present a modification of Katz and Yung’s construction which maintains the round complexity of their compiler, but for ‘typical’ unauthenticated group key establishments adds authentication in such a way that deniability is achieved...

We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions and analyze the impact of garbage collection and virtual memory paging, as well. Our empirical st...

In this paper we summarize our recent work on information-theoretically secure wireless relay network communication. In such communication, the goal is to send information between two special nodes (“source” and “destination”) in a (memoryless) network with authenticated relays, where the secrecy is with respect to a class of eavesdroppers. We develop achievable secrecy rates when authenticated...

Authenticated group key agreement problem is important in many modern collaborative and distributed applications. Recently, there are two ID-based authenticated group key agreement schemes have been proposed, one is Choi et al.’s [2] scheme, the other is Du et al.’s [3] scheme. They are all constructed from bilinear pairings based on Burmester and Desmedt scheme [1]. In this paper, we propose a...

We study a new model for data authentication over peer-to-peer storage networks, where data is stored, queried and authenticated in a totally distributed fashion. The model captures the security requirements of emerging distributed computing applications. We present an efficient implementation of a distributed Merkle tree, which realizes a Merkle tree over a peer-to-peer network, thus extending...

In this paper, we propose a lightweight authenticated encryption mode JAMBU. It only needs n-bit extra register for a block cipher with 2n-bit block size. It achieves n-bit authentication security when 2 bits are processed under a single key. When nonce (IV) is reused, the encryption security is similar to that of the CFB mode while the message authentication maintains strong security. We insta...

SOBER-128 is a stream cipher designed by Rose and Hawkes in 2003. It can be also used for generating Message Authentication Codes (MACs) and an authenticated encryption. The developers claimed that it is difficult to forge MACs generated by both functions of SOBER128, though, the security assumption in the proposal paper is not realistic in some instances. In this paper, we examine the security...

Since Bellare and Rogaway’s work in 1994, the indistinguishability-based security models of authenticated key agreement protocols in simple cases have been evolving for more than ten years. In this paper, we review and organize the models under a unified framework with some new extensions. By providing a new ability (the Coin query) to adversaries and redefining two key security notions, the fr...