Small transitive homogeneous $3$-$(v,\{4,6\},1)$ designs

Autor: Epstein, M., Kreher, D. L., Magliveras, S. S.

A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points we invest

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

Privacy-Preserving ECC-Based Grouping Proofs for RFID

Autor: Batina, L., Lee, Y., Seys, S., Singelée, D., Verbauwhede, I., Burmester, M., Tsudik, G., Magliveras, S., Ilic, I.

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642181771
ISC
Lecture Notes in Computer Science ; 6531, 159-165. Berlin / Heidelberg : Springer
STARTPAGE=159;ENDPAGE=165;TITLE=Lecture Notes in Computer Science ; 6531
Burmester, M.; Tsudik, G.; Magliveras, S. (ed.), Information Security, pp. 159-165

The concept of grouping proofs has been introduced by Juels to permit RFID tags to generate a verifiable proof that they have been scanned simultaneously, even when readers or tags are potentially untrusted. In this paper, we extend this concept and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ff6f9eaeee1183fc04f8ec3e43fcd4e
https://doi.org/10.1007/978-3-642-18178-8_14

Compression independent object encryption for ensuring privacy in video surveillance.

Autor: Carrillo, P., Kalva, H., Magliveras, S.

Publikováno v: 2008 IEEE International Conference on Multimedia & Expo; 2008, p273-276, 4p

Lexical Permutation Sorting Algorithm.

Autor: Arnavut, Z., Magliveras, S. S.

Publikováno v: Computer Journal; 1997, Vol. 40 Issue 5, p292-295, 4p

On the number of mutually disjoint cyclic designs and large sets of designs

Autor: Bluskov, I., Magliveras, S. S.

Publikováno v: Journal of Statistical Planning & Inference; 2001, Vol. 95 Issue: 1 p133-142, 10p