Výsledky vyhledávání - "Stinson D. R."

Akademický článek

An efficient identification protocol secure against concurrent-reset attacks

Autor: Wu J., Stinson D. R.

Publikováno v: Journal of Mathematical Cryptology, Vol 3, Iss 4, Pp 339-352 (2009)

In this paper, first we discuss the security model for deterministic challenge-response identification protocols. For such protocols, we are able to simplify the CR2 security model in [Bellare, Fischlin, Goldwasser, and Micali, Identification protoco

Externí odkaz: https://doaj.org/article/7d16988b40e84d87864293fa13ddd176

Zobrazit plný text záznamu

Akademický článek

Two attacks on a sensor network key distribution scheme of Cheng and Agrawal

Autor: Paterson M. B., Stinson D. R.

Publikováno v: Journal of Mathematical Cryptology, Vol 2, Iss 4, Pp 393-403 (2008)

A sensor network key distribution scheme for hierarchical sensor networks was recently proposed by Cheng and Agrawal. A feature of their scheme is that pairwise keys exist between any pair of high-level nodes (which are called cluster heads) and betw

Externí odkaz: https://doaj.org/article/173b4d15cafa45d09e54163262087378

Zobrazit plný text záznamu

Akademický článek

An efficient and secure two-flow zero-knowledge identification protocol

Autor: Stinson D. R., Wu J.

Publikováno v: Journal of Mathematical Cryptology, Vol 1, Iss 3, Pp 201-220 (2007)

In this paper, we propose a new zero-knowledge identification protocol. While the protocol consists of only two message flows, it does not rely on any underlying signature or encryption scheme. Its zero-knowledge property is preserved under concurren

Externí odkaz: https://doaj.org/article/e1222b2b47d147cab4dace9bf9e18c0c

Zobrazit plný text záznamu

Akademický článek

Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols

Autor: Stinson D. R., Wei R.

Publikováno v: Journal of Mathematical Cryptology, Vol 1, Iss 1, Pp 33-46 (2007)

In this paper, we investigate query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval (PIR) schemes. We begin by formulating a simplified model for PIR schemes which is equivalent

Externí odkaz: https://doaj.org/article/7d0b58e8e8384fd88b8f16be9452b433

Zobrazit plný text záznamu

Report

On Partial Sums in Cyclic Groups

Autor: Archdeacon, D. S., Dinitz, J. H., Mattern, A., Stinson, D. R.

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this problem.

Externí odkaz: http://arxiv.org/abs/1501.06872

Zobrazit plný text záznamu

Report

Packing Costas Arrays

Autor: Dinitz, J. H., Ostergard, P. R. J., Stinson, D. R.

A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point of view. A complete classification is carried out up to order 27. In

Externí odkaz: http://arxiv.org/abs/1102.1332

Zobrazit plný text záznamu