Wyniki wyszukiwania - BazTech

1

Distributed certificate authority in cluster-based manet using multi secret sharing scheme

Azza M, Hacene S B

Advances in Science and Technology. Research Journal

|

2015

|

Vol. 9, nr 28

1--9

EN

Providing secure communications in mobile ad hoc networks (MANET) is an important and difficult problem, due to a lack of a key management infrastructure. The authentication is an important security service in (MANETs). To provide a node authentication service we use a fully distributed certificate authorities (FDCA) based on the threshold cryptography. In this paper we propose an efficient and verifiable multi secret sharing scheme in cluster-based MANET with a low computation system. Our scheme is based on the overdetermined linear system equation in Galois fields GF(2r). We have analyzed our scheme based on security and performance criteria, and compared with existing approaches. The efficiency of our proposed schemes was verified and evaluated by simulation. Simulation results show that this approach is scalable.

2

Remarks on multivariate extensions of polynomial based secret sharing schemes

Derbisz J.

Studia Bezpieczeństwa Narodowego

|

2014

|

R. 4, Nr 6

285--297

EN

We introduce methods that use Gröbner bases for secure secret sharing schemes. The description is based on polynomials in the ring R = K[X1,...,Xl] where identities of the participants and shares of the secret are or are related to ideals in R. Main theoretical results are related to algorithmical reconstruction of a multivariate polynomial from such shares with respect to given access structure, as a generalisation of classical threshold schemes. We apply constructive Chinese remainder theorem in R of Becker and Weispfenning. Introduced ideas ﬁnd their detailed exposition in our related works.

PL

Wprowadzamy metody wykorzystujące bazy Gröbnera do schematów podziału sekretu. Opis bazuje na wielomianach z pierścienia R = K[X1,...,Xl], gdzie tożsamości użytkowników oraz ich udziały są lub są związane z ideałami w R. Główne teoretyczne rezultaty dotyczą algorytmicznej rekonstrukcji wielomianu wielu zmiennych z takich udziałów zgodnie z zadaną (dowolną) strukturą dostępu, co stanowi uogólnienie klasycznych schematów progowych. W pracy wykorzystujemy konstruktywną wersję Chińskiego twierdzenia o resztach w pierścieniu R pochodzącą od Beckera i Weispfenninga. Wprowadzone idee znajdują swój szczegółowy opis w naszych związanych z tym tematem pracach.

3

E-voting system with distributed responsibility

Kapusta J.

Journal of Applied Computer Science

|

2012

|

Vol. 20, nr 2

47-57

EN

In the paper a new scheme for secure e-voting system is presented. The proposed system is universal and effective. It can be used to carry out voting via the Internet, by using voting machines or other devices enabling the transmission of encrypted messages. The security mechanisms applied in the system are based on cryptographic mechanisms: secret sharing schemes and electronic signatures. The system features with distribution of responsibility among several authorized entities.

4

A remark on hierarchical threshold secret sharing

Kawa R., Kula M.

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

|

2012

|

Vol. 12, no. 3

55--64

EN

The main results of this paper are theorems which provide a solution to the open problem posed by Tassa [1]. He considers a specific family Γv of hierarchical threshold access structures and shows that two extreme members Γ∧ and Γv of Γv are realized by secret sharing schemes which are ideal and perfect. The question posed by Tassa is whether the other members of Γv can be realized by ideal and perfect schemes as well. We show that the answer in general is negative. A precise definition of secret sharing scheme introduced by Brickell and Davenport in [2] combined with a connection between schemes and matroids are crucial tools used in this paper. Brickell and Davenport describe secret sharing scheme as a matrix M with n+1 columns, where n denotes the number of participants, and define ideality and perfectness as properties of the matrix M. The auxiliary theorems presented in this paper are interesting not only because of providing the solution of the problem. For example, they provide an upper bound on the number of rows of M if the scheme is perfect and ideal.