activity
20022008
most citedOn graph coloring check-digit method

3 citations · 10 across the 8 of their papers we have counts for

collaborators
Showing cs.CRShow all

6 papers · 1 filter

cs.CR2006

Lightweight security mechanism for PSTN-VoIP cooperation

Wojciech Mazurczyk, Zbigniew Kotulski

In this paper we describe a new, lightweight security mechanism for PSTN-VoIP cooperation that is based on two information hiding techniques: digital watermarking and steganography…

cs.CR20052 cited

Security of mobile agents: a new concept of the integrity protection

Aneta Zwierko, Zbigniew Kotulski

The recent developments in the mobile technology (mobile phones, middleware) created a need for new methods of protecting the code transmitted through the network. The proposed mec…

cs.CR20051 cited

Alternative security architecture for IP Telephony based on digital watermarking

Wojciech Mazurczyk, Zbigniew Kotulski

Problems with securing IP Telephony systems, insufficient standardization and lack of security mechanisms emerged the need for new approaches and solutions. In this paper a new, al…

cs.CR2003

Secret Sharing for n-Colorable Graphs with Application to Public Key Cryptography

Kamil Kulesza, Zbigniew Kotulski

At the beginning some results from the field of graph theory are presented. Next we show how to share a secret that is proper n-coloring of the graph, with the known structure. The…

cs.CR20033 cited

On secret sharing for graphs

Kamil Kulesza, Zbigniew Kotulski

In the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for "…

cs.CR20021 cited

On the graph coloring check-digit scheme with applications to verifiable secret sharing

Kamil Kulesza, Zbigniew Kotulski

In the paper we apply graph vertex coloring for verification of secret shares. We start from showing how to convert any graph into the number and vice versa. Next, theoretical resu…