Some Structural and Security Properties of the Modular Secret Sharing

We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. The proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the ring of integers. Our threshold schemes are perfect i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Symbolic and Numeric Algorithms for Scientific Computing, Proceedings s. 197 - 200
Hlavní autoři: Galibus, T., Matveev, G., Shenets, N.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2008
Témata:
Cryptography
Data analysis
Data security
Galois fields
Information security
Information theory
Mathematical model
Mathematics
Polynomials
Scientific computing
ISBN:0769535232, 9780769535234
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. The proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the ring of integers. Our threshold schemes are perfect i.e. secure in the sense of information theory and ideal i.e. efficient in the terms of memory storage (the size of the secret is equal to the size of the shares). Then we consider the modular secret sharing schemes with pairwise co-prime moduli over the ring of polynomials and the ring of integers. We give a complete description of the access structures that can be realized by such modular schemes.
AbstractList We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. The proposed modular schemes over these rings achieve improvements both in security and applicability compared to classical schemes over the ring of integers. Our threshold schemes are perfect i.e. secure in the sense of information theory and ideal i.e. efficient in the terms of memory storage (the size of the secret is equal to the size of the shares). Then we consider the modular secret sharing schemes with pairwise co-prime moduli over the ring of polynomials and the ring of integers. We give a complete description of the access structures that can be realized by such modular schemes.
Author Galibus, T.
Matveev, G.
Shenets, N.
Author_xml – sequence: 1
  givenname: T.
  surname: Galibus
  fullname: Galibus, T.
  organization: Dept. of Math. Modelling & Data Anal., Belorussian State Univ., Minsk, Belarus
– sequence: 2
  givenname: G.
  surname: Matveev
  fullname: Matveev, G.
– sequence: 3
  givenname: N.
  surname: Shenets
  fullname: Shenets, N.
  organization: Dept. of Math. Modelling & Data Anal., Belorussian State Univ., Minsk, Belarus
BookMark eNotjElPwzAYRC1BJUjplQsX_4EU78uxisoilUUyHDhVjvOZBqVJ5TiH_ntawVxGevM0Bbrshx4QuqVkSSmx9-7rdeWqJSPELKm4QAXRykouGWczVJyx5ZYydoUW4_hDTpHSGMuu0doNe8AupynkKfkO-77BDsKU2nzE72k4QMotjHiIOO8AvwzN1Pl0VhJk7HY-tf33DZpF342w-O85-nxYf1RP5ebt8blabcqWaplLoWtmvLYqyqBqIYLnMeo6BiV9w70G4Y21UVBlG6tAMnHaGNEmGM3Bej5Hd3-_LQBsD6nd-3TcSkaEoZT_AlqtTUs
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SYNASC.2008.14
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
Mathematics
EndPage 200
ExternalDocumentID 5204811
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i175t-47b28a796f5c6b44ca3ff7bfc65ad3a7e4a899f4169d96e524bfc2078c873e9a3
IEDL.DBID RIE
ISBN 0769535232
9780769535234
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000274363300031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 01:36:26 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2008939122
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-47b28a796f5c6b44ca3ff7bfc65ad3a7e4a899f4169d96e524bfc2078c873e9a3
PageCount 4
ParticipantIDs ieee_primary_5204811
PublicationCentury 2000
PublicationDate 2008-Sept.
PublicationDateYYYYMMDD 2008-09-01
PublicationDate_xml – month: 09
  year: 2008
  text: 2008-Sept.
PublicationDecade 2000
PublicationTitle Symbolic and Numeric Algorithms for Scientific Computing, Proceedings
PublicationTitleAbbrev SYNASC
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558892
Score 1.4372749
Snippet We mainly study the modular secret sharing over the ring of univariate polynomials over the Galois field. The proposed modular schemes over these rings achieve...
SourceID ieee
SourceType Publisher
StartPage 197
SubjectTerms Cryptography
Data analysis
Data security
Galois fields
Information security
Information theory
Mathematical model
Mathematics
Polynomials
Scientific computing
Title Some Structural and Security Properties of the Modular Secret Sharing
URI https://ieeexplore.ieee.org/document/5204811
WOSCitedRecordID wos000274363300031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFL0qFQMs0AfiLQ8MIBGa2E5sj6hqxdKqUkAqU-X4IXUgqdrC92OnbmBgYcvTTnwV3WPnnHMB7gjWDqjaOBI4VhHNcBIV2gVEFoK7cLsMb3VdbIJNp3w-F7MWPDZaGGNMTT4zT36z_pevK_Xpl8oGqXeZ9ULeA8aynVarWU-J05RzEWbmwpuWEBwMdvb7NJg2JrEY5O_T53y441J6Bc-v0ip1Zhmf_O-ZTqH_I9FDsyb5dKBlyi4cTxoT1k0XOuG73aD7YC790INRXn0YlNeusd5xA8lSozwUsfMtrjzR2t1TWeTaQpNKe6Kqv2Rttsj7O7v--vA2Hr0OX6JQSiFaOnywjSgrMJdMZDZVWUGpksRaVliVpVITyQyVbuJlHToTWmQmxdSdww4-KM6IEZKcQbusSnMOSEviQJimLNOaKsYFN1gk1mCbWkykvYCeH6XFaueWsQgDdPn34Ss42jMw4uQa2u71zQ0cqq_tcrO-rUP8DX3Jo1w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGA5jCupF9yF-m4MHBevaJG2So4yNidsYdMI8jTQfsIPt2Ka_36TLqgcv3vqZlvelvE_S93keAO4wUhaomjDgKJQBSVAUZMomRGSc2XTbCm9UaTZBx2M2m_FJDTxWXBitddl8pp_cZvkvXxXy0y2VdWKnMuuIvHvOOcuztaoVlTCOGeN-bs6dbAlGXmJnt0-8bGMU8k76Pn5Ou9tuSsfh-WWuUtaW_vH_3uoEtH9IenBSlZ8GqOm8CY5GlQzrugka_stdw3svL_3QAr20-NAwLXVjneYGFLmCqbexcyMuXau1vacw0I4FR4VyrarukpXeQKfwbJ_XBm_93rQ7CLyZQrCwCGETEJohJihPTCyTjBApsDE0MzKJhcKCaiLs1MtYfMYVT3SMiD2HLICQjGLNBT4F9bzI9RmASmALwxShiVJEUsaZRjwyGpnYICzMOWi5KM2XW72MuQ_Qxd-Hb8HBYDoazocv49dLcLjrxwijK1C3odDXYF9-bRbr1U2Z7m8ytKal
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Symbolic+and+Numeric+Algorithms+for+Scientific+Computing%2C+Proceedings&rft.atitle=Some+Structural+and+Security+Properties+of+the+Modular+Secret+Sharing&rft.au=Galibus%2C+T.&rft.au=Matveev%2C+G.&rft.au=Shenets%2C+N.&rft.date=2008-09-01&rft.pub=IEEE&rft.isbn=9780769535234&rft.spage=197&rft.epage=200&rft_id=info:doi/10.1109%2FSYNASC.2008.14&rft.externalDocID=5204811
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769535234/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769535234/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769535234/sc.gif&client=summon&freeimage=true