Secret-sharing schemes and orthogonal systems of k-ary operations

Belyavskaya Galina

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

825

SM ISO690:2012

BELYAVSKAYA, Galina. Secret-sharing schemes and orthogonal systems of k-ary operations. In: Quasigroups and Related Systems, 2009, vol. 17, nr. 2(22), pp. 161-176. ISSN 1561-2848.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Quasigroups and Related Systems

Volumul 17, Numărul 2(22) / 2009 / ISSN 1561-2848

Secret-sharing schemes and orthogonal systems of k-ary operations

Pag. 161-176

Belyavskaya Galina

Disponibil în IBN: 14 decembrie 2013

Descarcă PDF

Rezumat

We suggest a general method of the construction of secret-sharing schemesbased on orthogonal systems of partial (in particular, everywhere determined) k-ary operations which generalizes some known methods of the construction of such schemes by a nite elds and point the orthogonal systems of k-ary operations respecting to these known schemes. The dierent transformations of orthogonal systems of k-ary operations are reformulated and applied to orthogonal systems of polynomial k-ary operations over nite elds, in particular, to orthogonal systems corresponding to some known schemes.

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-21776</cfResPublId>
<cfResPublDate>2009-07-01</cfResPublDate>
<cfVol>22</cfVol>
<cfIssue>2</cfIssue>
<cfStartPage>161</cfStartPage>
<cfISSN>1561-2848</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/21776</cfURI>
<cfTitle cfLangCode='RO' cfTrans='o'>Secret-sharing schemes and orthogonal systems of k-ary operations</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'>We suggest a general method of the construction of secret-sharing schemesbased on orthogonal systems of partial (in particular, everywhere determined) k-ary operations which generalizes some known methods of the construction of such schemes by a nite elds and point the orthogonal systems of k-ary operations respecting to these known schemes. The dierent transformations of orthogonal systems of k-ary operations are reformulated and applied to orthogonal systems of polynomial k-ary operations over nite elds, in particular, to orthogonal systems corresponding to some known schemes.</cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009-07-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2009-07-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-28019</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009-07-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-28019</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-28019-2</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2009-07-01T24:00:00</cfStartDate>
<cfFamilyNames>Belyavskaya</cfFamilyNames>
<cfFirstNames>Galina</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>