US20050111657A1  Weighted secret sharing and reconstructing method  Google Patents
Weighted secret sharing and reconstructing method Download PDFInfo
 Publication number
 US20050111657A1 US20050111657A1 US10/960,278 US96027804A US2005111657A1 US 20050111657 A1 US20050111657 A1 US 20050111657A1 US 96027804 A US96027804 A US 96027804A US 2005111657 A1 US2005111657 A1 US 2005111657A1
 Authority
 US
 United States
 Prior art keywords
 secret
 voices
 errors
 participants
 code
 Prior art date
 Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
 Granted
Links
 230000000875 corresponding Effects 0.000 claims description 12
 238000004590 computer program Methods 0.000 claims 6
 238000000034 methods Methods 0.000 description 6
 281000137952 General Computer companies 0.000 description 1
 230000005540 biological transmission Effects 0.000 description 1
 239000000969 carriers Substances 0.000 description 1
 230000002452 interceptive Effects 0.000 description 1
Images
Classifications

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
 H04W52/04—TPC
 H04W52/30—TPC using constraints in the total amount of available transmission power

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
 H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, nonrepudiation, key authentication or verification of credentials

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06F—ELECTRIC DIGITAL DATA PROCESSING
 G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
 G06F21/305—Authentication, i.e. establishing the identity or authorisation of security principals by remotely controlling device operation

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06F—ELECTRIC DIGITAL DATA PROCESSING
 G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F21/60—Protecting data
 G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
 G06F21/6209—Protecting access to data via a platform, e.g. using keys or access control rules to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06F—ELECTRIC DIGITAL DATA PROCESSING
 G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
 G06F21/71—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
 G06F21/74—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information operating in dual or compartmented mode, i.e. at least one secure mode

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06F—ELECTRIC DIGITAL DATA PROCESSING
 G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
 G06F21/88—Detecting or preventing theft or loss

 G—PHYSICS
 G11—INFORMATION STORAGE
 G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
 G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
 G11B20/10—Digital recording or reproducing
 G11B20/10009—Improvement or modification of read or write signals

 G—PHYSICS
 G11—INFORMATION STORAGE
 G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
 G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
 G11B20/10—Digital recording or reproducing
 G11B20/10009—Improvement or modification of read or write signals
 G11B20/10305—Improvement or modification of read or write signals signal quality assessment
 G11B20/10398—Improvement or modification of read or write signals signal quality assessment jitter, timing deviations or phase and frequency errors
 G11B20/10425—Improvement or modification of read or write signals signal quality assessment jitter, timing deviations or phase and frequency errors by counting outoflock events of a PLL

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03L—AUTOMATIC CONTROL, STARTING, SYNCHRONISATION, OR STABILISATION OF GENERATORS OF ELECTRONIC OSCILLATIONS OR PULSES
 H03L7/00—Automatic control of frequency or phase; Synchronisation
 H03L7/06—Automatic control of frequency or phase; Synchronisation using a reference signal applied to a frequency or phaselocked loop
 H03L7/08—Details of the phaselocked loop
 H03L7/085—Details of the phaselocked loop concerning mainly the frequency or phasedetection arrangement including the filtering or amplification of its output signal
 H03L7/091—Details of the phaselocked loop concerning mainly the frequency or phasedetection arrangement including the filtering or amplification of its output signal the phase or frequency detector using a sampling device

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
 H03M13/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
 H03M13/2903—Methods and arrangements specifically for encoding, e.g. parallel encoding of a plurality of constituent codes

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
 H03M13/2957—Turbo codes and decoding
 H03M13/2993—Implementing the return to a predetermined state, i.e. trellis termination

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/63—Joint error correction and other techniques
 H03M13/635—Error control coding in combination with rate matching
 H03M13/6356—Error control coding in combination with rate matching by repetition or insertion of dummy data, i.e. rate reduction

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
 H03M13/63—Joint error correction and other techniques
 H03M13/635—Error control coding in combination with rate matching
 H03M13/6362—Error control coding in combination with rate matching by puncturing

 H—ELECTRICITY
 H03—BASIC ELECTRONIC CIRCUITRY
 H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
 H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
 H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
 H03M7/40—Conversion to or from variable length codes, e.g. ShannonFano code, Huffman code, Morse code
 H03M7/4006—Conversion to or from arithmetic code

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04B—TRANSMISSION
 H04B10/00—Transmission systems employing electromagnetic waves other than radiowaves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
 H04B10/25—Arrangements specific to fibre transmission
 H04B10/2575—Radiooverfibre, e.g. radio frequency signal modulated onto an optical carrier
 H04B10/25752—Optical arrangements for wireless networks
 H04B10/25753—Distribution optical network, e.g. between a base station and a plurality of remote units
 H04B10/25754—Star network topology

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04B—TRANSMISSION
 H04B7/00—Radio transmission systems, i.e. using radiation field
 H04B7/24—Radio transmission systems, i.e. using radiation field for communication between two or more posts
 H04B7/26—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
 H04B7/2628—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile using codedivision multiple access [CDMA] or spread spectrum multiple access [SSMA]

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04J—MULTIPLEX COMMUNICATION
 H04J13/00—Code division multiplex systems
 H04J13/0077—Multicode, e.g. multiple codes assigned to one user

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04J—MULTIPLEX COMMUNICATION
 H04J13/00—Code division multiplex systems
 H04J13/16—Code allocation

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0064—Concatenated codes
 H04L1/0066—Parallel concatenated codes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L1/00—Arrangements for detecting or preventing errors in the information received
 H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
 H04L1/0056—Systems characterized by the type of code used
 H04L1/0067—Rate matching
 H04L1/0068—Rate matching by puncturing

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
 H04L25/03006—Arrangements for removing intersymbol interference
 H04L25/03012—Arrangements for removing intersymbol interference operating in the time domain
 H04L25/03019—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception
 H04L25/03038—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception with a nonrecursive structure

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/38—Synchronous or startstop systems, e.g. for Baudot code
 H04L25/40—Transmitting circuits; Receiving circuits
 H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems
 H04L25/497—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems by correlative coding, e.g. partial response coding or echo modulation coding transmitters and receivers for partial response systems

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L51/00—Arrangements for usertouser messaging in packetswitching networks, e.g. email or instant messages
 H04L51/28—Details regarding addressing issues

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L51/00—Arrangements for usertouser messaging in packetswitching networks, e.g. email or instant messages
 H04L51/38—Arrangements for usertouser messaging in packetswitching networks, e.g. email or instant messages in combination with wireless systems

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L65/00—Network arrangements or protocols for realtime communications
 H04L65/10—Signalling, control or architecture
 H04L65/1003—Signalling or session protocols
 H04L65/1006—SIP

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
 H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
 H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
 H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
 H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
 H04L9/304—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy based on error correction codes, e.g. McEliece

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
 H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
 H04N19/103—Selection of coding mode or of prediction mode
 H04N19/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
 H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
 H04N19/136—Incoming video signal characteristics or properties
 H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
 H04N19/139—Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
 H04N19/625—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using discrete cosine transform [DCT]

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10H04N19/85, e.g. fractals
 H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
 H04W4/12—Messaging; Mailboxes; Announcements
 H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W76/00—Connection management
 H04W76/10—Connection setup
 H04W76/12—Setup of transport tunnels

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06F—ELECTRIC DIGITAL DATA PROCESSING
 G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F2221/2105—Dual mode as a secondary aspect

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06F—ELECTRIC DIGITAL DATA PROCESSING
 G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
 G06F2221/2115—Third party

 G—PHYSICS
 G11—INFORMATION STORAGE
 G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
 G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
 G11B20/22—Signal processing not specific to the method of recording or reproducing; Circuits therefor for reducing distortions

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L51/00—Arrangements for usertouser messaging in packetswitching networks, e.g. email or instant messages
 H04L51/04—Realtime or near realtime messaging, e.g. instant messaging [IM]

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L65/00—Network arrangements or protocols for realtime communications
 H04L65/10—Signalling, control or architecture
 H04L65/1013—Network architectures, gateways, control or user entities
 H04L65/1016—IMS

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
 H04W4/12—Messaging; Mailboxes; Announcements

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
 H04W72/04—Wireless resource allocation
 H04W72/0406—Wireless resource allocation involving control information exchange between nodes
 H04W72/042—Wireless resource allocation involving control information exchange between nodes in downlink direction of a wireless link, i.e. towards terminal

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W8/00—Network data management
 H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
 H04W8/24—Transfer of terminal data
 H04W8/245—Transfer of terminal data from a network towards a terminal

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W8/00—Network data management
 H04W8/26—Network addressing or numbering for mobility support

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04W—WIRELESS COMMUNICATION NETWORKS
 H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
 H04W88/08—Access point devices
 H04W88/085—Access point devices with remote components

 Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSSSECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSSREFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
 Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
 Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSSREFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
 Y10S370/00—Multiplex communications
 Y10S370/901—Wide area network
 Y10S370/902—Packet switching
 Y10S370/903—Osi compliant network
 Y10S370/906—Fiber data distribution interface, FDDI

 Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSSSECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSSREFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
 Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
 Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSSREFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
 Y10S370/00—Multiplex communications
 Y10S370/901—Wide area network
 Y10S370/902—Packet switching
 Y10S370/903—Osi compliant network
 Y10S370/907—Synchronous optical network, SONET
Abstract
Description
 This application claims the priority of Korean Patent Application No. 200370026 filed on Oct. 8, 2003 in the Korean Intellectual Property Office, the disclosure of which is incorporated herein in its entirety by reference.
 1. Field of the Invention
 The present invention relates to a weighted secret sharing and reconstructing method, and more particularly, to a method of sharing and reconstructing a secret using a weighted error vector.
 2. Description of the Related Art
 When there are a set R of N participants and a set L of subsets of the N participants, a threshold secret sharing scheme distributes shares of a secret to the N participants and allows the secret to be reconstructed when subsets of participants belong to the set L.
 An ideal threshold secret sharing scheme has the following characteristics: (i) all participants must take part in key agreement of the set R; (ii) a master private key of the set R is not disclosed to all the participants; (iii) at least a predetermined number (i.e., a threshold) of participants must participate in a process of decrypting a message encrypted by the master private key; (iv) at least a predetermined number (i.e., a threshold) of participants must participate in a signature procedure of the message using the master private key; (v) after setting the scheme, the process of decryption or signature of the message by the participants whose subsets belong to the set L is noninteractive; and (vi) the master private key or a public key shall not be changed even when a new participant is included in the set R or a participant belonging to the set R leaves the set R.
 A (k,N) threshold secret sharing scheme is another example of the threshold secret sharing scheme. The (k,N) threshold secret sharing scheme allows a secret to be reconstructed when k of N dispersed secret shares are collected.
FIG. 1 illustrates a a conventional (k,N) threshold secret sharing scheme. Referring toFIG. 1 , a secret 10 is divided into secret shares with equal importance and distributed to N participants 11. The secret 10 is reconstructed by collecting the secret shares of at least three of the N participants, combining them (see reference numeral 12), and reconstructing a secret 13.  However, the (k,N) threshold secret sharing scheme is disadvantageous in that at least k secret shares are required to reconstruct a secret since N secret shares with equal importance are distributed to N participants. For instance, it is impossible to completely reconstruct the secret when (k−1) secret shares are collected and combined.
 Alternatively, a hierarchical threshold secret sharing scheme, which is yet another example of the threshold secret sharing scheme and allows each level of a multilevel structure to share a secret, needs to give a hierarchical grant to a participant who desires to access the multilevel structure.
 The present invention provides a weighted secret sharing and reconstructing method in which secret shares with different weights are distributed to participants, so that a secret may be completely reconstructed even when (k−1) secret shares are collected and combined.
 According to an aspect of the present invention, a method of sharing a secret, includes encoding the secret using a predetermined code, producing voices so that different weights are given to errors in an error vector according to locations of the errors, encrypting the code using the error vector, and distributing a result of encryption to a plurality of participants.
 According to another aspect of the present invention, a method reconstructs a secret distributed to participants after encoding the secret using a predetermined code, generating voices so that different weights are given to errors in an error vector according to locations of the errors, and encrypting the code using the error vector. The method includes determining a number of voices required to decode the code, selecting a part of participants according to the determined number of voices, collecting the secret from the selected participants, and reconstructing the secret by decrypting and errorcorrection decoding the secret.
 According to yet another aspect of the present invention, a method of sharing and reconstructing a secret includes encoding the secret using a predetermined code, producing voices so that different weights are given to errors in an error vector according to locations of the errors, encrypting the code using the error vector and distributing a result of encrypting to participants; determining a number of voices required to decode the code; selecting parts of the participants by the determined number of voices; collecting the secret from the selected participants, and reconstructing the secret by decrypting and errorcorrection decoding the secret.
 Additional aspects and/or advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
 These and/or other aspects and advantages of the invention will become apparent and more readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:

FIG. 1 is a schematic representation of a conventional (k,N) threshold secret sharing scheme; 
FIG. 2 is a schematic representation of a (K,N) weighted threshold secret sharing method according to an embodiment of the present invention; 
FIG. 3 is a flowchart illustrating a method of sharing and reconstructing a secret, according to an embodiment of the present invention; 
FIG. 4 is a schematic representation illustrating a method of encrypting a secret in accordance with an embodiment of the present invention when a weight enabling error correction is 3; 
FIG. 5 is a schematic representation illustrating a method of collecting shares of a secret from three participants whose voices are 1, respectively, and reconstructing the secret, according to an embodiment of the present invention; 
FIG. 6 is a schematic representation illustrating a method of collecting shares of a secret from two participants whose voices are 1 and 2, respectively, and reconstructing the secret, according to an embodiment of the present invention; 
FIG. 7 is a schematic representation illustrating a process of collecting shares of a secret from two participants whose voices are 1, respectively, and attempting to reconstruct the secret, according to an embodiment of the present invention, with a result of decrypting the secret and obtaining two errors with a voice of 1 and an error with a voice of 2.  Reference will now be made in detail to the embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout. The embodiments are described below to explain the present invention by referring to the figures.

FIG. 2 is a schematic representation of a (K,N) weighted threshold sharing and distributing method according to an embodiment of the present invention. Referring toFIG. 2 , a secret 20 is divided into secret shares with different weights and distributed to N participants 21. The secret 20 is reconstructed as a secret 23 either by collecting secret shares from two participants of the N participants 21, wherein one the participants has a weighted secret share, and combining the collected secret shares, or by collecting nonweighted secret shares from three participants and combining the collected secret shares.  More specifically, a secret S is divided into N secret shares, and the N secret shares are distributed to N participants who are interlinked via a channel, respectively. The secret S is encrypted using an error vector e and distributed, according to the McEliece technique.
 Every participant may access the secret S. A weight (wt) τ_{i }(i=1, 2, 3 . . . , N) is given to a secret share s_{i }according to a location i in the error vector.
$\begin{array}{cc}T=\sum _{i=1}^{N}\text{\hspace{1em}}{\tau}_{i},& \left(1\right)\end{array}$
wherein T denotes a total of weights given to the error vector.  According to the McEliece technique, when one of participants who receives the secret shares desires to reconstruct the secret S, the participant reconstructs the secret S using his/her secret share and (K−1) secret shares. In this case, weights given to the secret shares may be expressed as follows:
$\begin{array}{cc}\sum _{i=1}^{N}\text{\hspace{1em}}{\tau}_{i}\ge k,& \left(2\right)\end{array}$
wherein k denotes a minimum number of secret shares required to reconstruct the secret S.  To reconstruct the secret S, one of the N participants collects (K−1) encrypted secret shares from K−1 participants via a public communication channel. Next, the participant reconstructs the secret S by combining his/her secret share with the collected (K−1) secret shares and decrypting a result of the combination.
 To encrypt and decrypt the secret S, the present invention uses a generalized Goppa code. The qary generalized Goppa code with a length n is defined by an ntype vector α=(α_{1}α_{2 }. . . α_{n}) as follows:
$\begin{array}{cc}\sum _{i=1}^{n}\text{\hspace{1em}}{a}_{i}\frac{{V}_{i}\left(x\right)}{{U}_{i}\left(x\right)}\equiv 0\text{\hspace{1em}}\mathrm{mod}\text{\hspace{1em}}g\left(x\right),& \left(3\right)\end{array}$
wherein a_{i}∈GF(q), a locator set$L={\left\{\frac{{V}_{i}\left(x\right)}{{U}_{i}\left(x\right)}\right\}}_{i=1}^{n}$
wherein V_{i}(x) and U_{i}(x) are polynomials over GF(q^{m}). Here, GCD(U_{i}(x), V_{i}(x))=1, deg V_{i}(x)<deg U_{i}(x), and GCD(U_{i}(x), U_{i}(x))=1 for all i≠j. GCD denotes a greatest common measure, deg denotes a greatest degree of a polynomial, and g(x) denotes a Goppa polynomial over GF(q^{m}), satisfying GCD((U_{i}(x), g(x))=1 for i that ranges from 1 to n.  The generalized (L,g) Goppa code has a minimum distance of d_{0}≧d when d satisfies following Equation (4):
deg g(x)>(d−2)r+s (4),
wherein r=deg U_{i}(x) and s=deg V_{i}(x).  In the generalized Goppa code for enabling error correction, a locator set L may be determined with respect to the Goppa polynomial G(x), as follows:
$\begin{array}{cc}L=\underset{j=1}{\overset{l}{U}}{\left\{{R}_{i}^{\left(j\right)}\right\}}_{i=1}^{{n}_{j}},n=\sum _{j=1}^{l}\text{\hspace{1em}}{n}_{j},& \left(5\right)\end{array}$
wherein R_{i} ^{(j) }is a rational function and may be expressed as follows:
R _{i} ^{(j)} =V _{i} ^{(j)}(x)/U _{i} ^{(j)}(x) (6),
wherein deg V_{i} ^{(j)}(x)=r_{i}, deg U_{i} ^{(j)}(x)=τ_{i}, and (V_{i} ^{(j)}(x), U_{r} ^{(k)}(x))=1 with respect to arbitrary values i, j, k, and r.  If a vector a=(a_{1} ^{(1)}a_{2} ^{(1) }. . . a_{n} _{ 1 } ^{(1)}a_{1} ^{(2)}a_{2} ^{(2) }. . . a_{n} _{ 2 } ^{(2)}a_{1} ^{(1)}a_{2} ^{(1) }. . . a_{n} _{ l } ^{(1)}) is a codeword of the generalized (L,g) Goppa code with a length of n=n_{1}+n_{2}+ . . . +n_{l}, the Goppa polynomial g(x) and locator set L must satisfy following Equation (7):
$\begin{array}{cc}\sum _{i=1}^{l}\text{\hspace{1em}}\sum _{i=1}^{{n}_{j}}\text{\hspace{1em}}{a}_{i}^{\left(j\right)}\frac{{V}_{i}^{j}\left(x\right)}{{U}_{i}^{\left(j\right)}\left(x\right)}\equiv 0\text{\hspace{1em}}\mathrm{mod}\text{\hspace{1em}}g\left(x\right),& \left(7\right)\end{array}$  For the generalized Goppa code, it is possible to estimate its minimum distance. Using the generalized Goppa code with the Goppa polynomial g(x) and the locator set L, it is possible to correct an arbitrary error set T={t_{1}, t_{2}, . . . , t_{l}} that satisfies following Equation (8) with respect to the respective code blocks a_{1} ^{(1)}a_{2} ^{(1) }. . . a_{n} _{ l } ^{(1)}:
(deg g(x))/2≧t _{1}τ_{1} +t _{2}τ_{2} + . . . +t _{l}τ_{l} (8),
wherein t_{1}, t_{2}, . . . , and t_{l }denote numbers of errors contained in the code blocks with lengths of n_{1}, n_{2}, . . . , and n_{l}, respectively.  In the case of a generalized binary Goppa code, (deg g(x))/2 presented in Equation (8) is converted into (2 deg g(x))/2.
 It is assumed that there is generalized Goppa code of (36, 18, 7) where n_{1}=8, n_{2}=28 and the Goppa polynomial is g(x)=x^{6}+x+α^{3}, if α∈GF(2^{3}).
 In connection with the code block of the length n_{1}, we will use a function of first degree as follows:
U _{i} ^{(1)}=1/(x−α _{i}), i=1, . . . , n_{1}, α_{i}∈GF(2^{3}), α_{8}=0 (9)  In connection with the code block of the length n_{2}, we will use seconddegree polynomials, which are irreducible over GF (2^{3}), with coefficients belonging to GF(2^{3}), as follows:
{U_{1i} ^{(2)}(x), U_{2i} ^{(2)}(x), U_{3i} ^{(2)}, U_{4i} ^{(2)}(x)}_{i=1, . . . , 7} (10),
where U_{1i} ^{(2)}(x)=(α^{i}x)^{2}+α^{5}(α^{i}x)+α^{3}, U_{2i} ^{(2)}(x)=(α^{i}x)^{2}+α^{5}(α^{i}x)+α^{4}, U_{3i} ^{(2)}(x)=(α^{i}x)^{2}+α^{6}(α^{i}x)+α^{9}, and U_{4i} ^{(2)}(x)=(α^{i}x)^{2}+α^{3}(α^{1}x)+α.  d≧7 is obtained by Equation (4) and the binary generalized Goppa code allows correction of an error set T={t_{1}, t_{2}} that satisfies (2deg g(x))/2≧t_{1}+2t_{2}. Ranges of t_{1 }and t_{2 }are shown in Table 1.
TABLE 1 N_{1 }= 8 N_{2 }= 28 total length n = 36 t_{1} t_{2} total number of correctable errors t 0 ≦3 ≦3 ≦2 ≦2 ≦4 ≦4 ≦1 ≦5 ≦6 0 ≦6  When the generalized Goppa code has a locator set of a third degree polynomial, it is possible to correct an error set T={t_{1}, t_{2}, t_{3}} that satisfies (2deg g(x))/2≧t_{1}+2t_{2}+3t_{3}, using the generalized Goppa code with a length of n=n_{1}+n_{2}+n_{3}.
 A threshold secret sharing method adopting using a public key scheme, according to the present invention, may be realized using the Goppa code. In the method, an error vector e is known to all participants. Also, by properly selecting code parameters, the (K,N) threshold secret sharing scheme is realizable, where N=wt(e). Error correcting code may allow (d−1) or less errors to be corrected. Accordingly, a number of participants required to reconstruct a secret is at least K that satisfies wt(e)−K (d−1)/2, i.e., 2K 2 wt(e)−d+1. The minimum distance is d≦deg g(x)+1 when using Goppa code, and the minimum distance is d≦2(deg g(x))+1 when using binary Goppa code with a separable Goppa polynomial g(x).
 There may be a situation in which some of the participants who are taking part in secret decryption provide wrong values of their secret shares. For instance, when k_{1 }participants provide correct values of their secret shares, and k_{2 }participants provide wrong values of their secret shares, this situation may be expressed as follows:
wt(e)−k _{1} +k _{2}≦(d−1)/2
2k _{1}−2k _{2}≧2wt(e)−d+1 (11)  The above scheme may be generalized for a case wherein participants have different numbers of voices. Here, a voice is differentiated from a share, and a plurality of voices may be allocated to a secret share.
 For instance, when using the generalized Goppa code for correcting errors, a number of voices allocated to the participants may be determined by the degree of a locator. The degree of the locator corresponds to a location j of an error in the error vector e and is known to the participants. In a case of using the generalized Goppa code, the (k,T) or (K,N) weighted secret sharing scheme may be realized according to the following conditions.
 In the (k,T) or (K,N) weighted secret sharing scheme, T denotes a total number of voices used in the scheme and is equivalent to a weight given to the error vector e. That is, T=t_{1}τ_{1}+t_{2}τ_{2}+ . . . +t_{l}τ_{l}. Here, t_{i }denotes a number of nonzero values of the error vector e that corresponds to locations of locator polynomials with a degree of τ_{l}. N denotes a number of the participants that is equal to a sum of t_{1}, t_{2}, . . . , and t_{l}. k denotes a minimum number of voices required for secret reconstruction that is equal to a sum of t_{1}τ_{1}, t_{2}τ_{2}, . . . , and t_{l}τ_{l}. k_{i }denotes a number of participants with voices of τ_{i }that is equal to or larger than T−(deg g(x))/2. In the case of the binary Goppa code with a separable Goppa polynomial, k T−(deg g(x)). K denotes a minimum number of participants required for secret reconstruction wherein the minimum number is equal to a sum of k_{1}, k_{2}, . . . , and k_{l}.
 Hence, according to an embodiment of the present invention, k voices, rather than k secret shares, are required to reconstruct a secret, and participants may have different numbers of voices. A size of a secret share is not related to a weight or a number of voices.

FIG. 3 is a flowchart illustrating a method of sharing and reconstructing a secret according to an embodiment of the present invention. Referring toFIG. 3 , the secret is encoded using an error correcting code, preferably, the generalized Goppa code (operation 30). Then, code in which a plurality of code blocks with different lengths are concatenated together, similarly to code blocks determined by a locator set of the generalized Goppa code, is obtained. Next, voices are produced for error locations of error vectors which correspond to the respective code blocks (operation 31). The error vectors have different voices according to the error locations of errors in the code blocks obtained in operation 30. For instance, when a length n of the code obtained in operation 30 is a sum of n_{1 }and n_{2}, a voice of 1 is allocated to errors corresponding to n_{1 }in error vectors and a voice of 2 is allocated to errors corresponding to n_{2 }in error vectors. The error vectors are then added to the code obtained in operation 30, and the result of addition is encrypted. The result of encryption is distributed to N participants (operation 32). Here, N=wt(e).  To reconstruct the secret, a number (k, T) of voices required to decode the secret is determined (operation 33). Next, a number k_{i }of participants is determined by the number (k, T) of voices (operation 34). For instance, if (k, T) is (5, 11), t_{1}=7 and t_{2}=2 when N=9. Thus, (k_{1}, k_{2}) may be one of (1,2), (3,1), and (5,0) since k_{1}+2k_{2}=k. Each combination of (1,2), (3,1), and (5,0) corresponds to (K=3, N=9), (K=4, N=9), and (K=5, N=9), respectively.
 After determining the number k_{i }of participants, the secret is reconstructed by collecting secret shares from the number k_{i }of participants (operation 35), and decrypting and errorcorrecting decoding the collected secret shares (operation 36).

FIGS. 4 through 7 are schematic representations illustrating weighted secret sharing and reconstructing methods according to embodiments of the present invention.  In detail,
FIG. 4 illustrates a method of encrypting a secret when a weight for error correction is set to 3. It is assumed that a left codebook outlined with a thick line indicates a code block when a voice is 1, and a right codebook outline with a thick line indicates a code block when a voice is 2. InFIG. 4 , a, e, and b represent results of encoding the secret, an error vector, and a result of encrypting the secret. 
FIG. 5 illustrates a method of restoring a secret from three participants who each hold a voice, respectively, and reconstructing the secret, according to an embodiment of the present invention. Referring toFIG. 5 , a result c of decrypting the secret collected from the three participants contains an error with a voice of 1 and an error with a voice of 2. Next, the secret may be reconstructed by decoding the result c using an error correction and decoding algorithm. 
FIG. 6 illustrates a method of restoring a secret from two participants who hold a voice of 1 and a voice of 2, respectively, and reconstructing the secret, according to an embodiment of the present invention. Referring toFIG. 6 , a result c of decrypting the secret collected from the two participants contains three errors with a voice of 1. The secret may be reconstructed by decoding the result c using an error correction and decoding algorithm. 
FIG. 7 illustrates a method of collecting a secret from two participants who each have a voice of 1, and attempting to reconstruct the secret, according to an embodiment of the present invention. Referring toFIG. 7 , a result c of decrypting the secret collected from the two participants contains two errors with a voice of 1 and an error with a voice of 2. In this case, since a total weight of voices equals 4, which exceeds a weight of 3, which is a highest total number that would enable error correction, the secret may not be reconstructed using the error correction and decoding algorithm of the present invention. In other words, the secret may be reconstructed using the present invention only when a number of correctable errors is equal to, or larger than, a weight of errors reflecting the voices.  The present invention may be embodied as a program stored on a computer readable medium that can be run on a general computer. Here, the computer readable medium includes, but is not limited to, storage media such as magnetic storage media (e.g., ROM's, floppy disks, hard disks, and the like), optically readable media (e.g., CDROMs, DVDs, etc.), and carrier waves (e.g., transmission over the Internet). The present invention may also be embodied as a computer readable program code unit stored on a computer readable medium, for causing a number of computer systems connected via a network to affect distributed processing.
 As described above, according to the present invention, a scheme may be realized wherein a weight of secret share does not depend on its size by using an error correcting code with an unequal error correction capability. Further, a weighted secret sharing scheme according to the present invention provides a constructive method to utilize parameters of a (K, N) weighted secret sharing scheme to share and reconstruct a secret.
 Although a few embodiments of the present invention have been shown and described, it would be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents.
Claims (24)
Priority Applications (2)
Application Number  Priority Date  Filing Date  Title 

KR200370026  20031008  
KR1020030070026A KR100561846B1 (en)  20031008  20031008  Weighted secret sharing and recovering method 
Publications (2)
Publication Number  Publication Date 

US20050111657A1 true US20050111657A1 (en)  20050526 
US7551740B2 US7551740B2 (en)  20090623 
Family
ID=34545548
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

US10/960,278 Active 20260627 US7551740B2 (en)  20031008  20041008  Weighted secret sharing and reconstructing method 
Country Status (4)
Country  Link 

US (1)  US7551740B2 (en) 
JP (1)  JP2005117670A (en) 
KR (1)  KR100561846B1 (en) 
CN (1)  CN100466514C (en) 
Cited By (13)
Publication number  Priority date  Publication date  Assignee  Title 

US20060280203A1 (en) *  20050614  20061214  Fujitsu Limited  Communication control apparatus and communication control method 
US20100151724A1 (en) *  20081215  20100617  Kondas Shawn J  Wall panel electrical distribution system 
US20110091033A1 (en) *  20080520  20110421  Irdeto B.V.  Cryptographic system 
US20120221854A1 (en) *  20041025  20120830  Security First Corp.  Secure data parser method and system 
FR2985626A1 (en) *  20120330  20130712  France Telecom  Method for transmission of confidential data divided into segments to e.g. fixed terminals, in network gaming field, involves decoding segments actually transmitted by error correction code to find value of segments of data 
US20160021101A1 (en) *  20140721  20160121  Ercom Engineering Reseaux Communications  Method for backing up a user secret and method for recovering a user secret 
US9589148B2 (en)  20100331  20170307  Security First Corp.  Systems and methods for securing data in motion 
US9785785B2 (en)  20100920  20171010  Security First Corp.  Systems and methods for secure data sharing 
US9916456B2 (en)  20120406  20180313  Security First Corp.  Systems and methods for securing and restoring virtual machines 
US10108807B2 (en)  20051118  20181023  Security First Corp.  Secure data parser method and system 
US10505723B1 (en) *  20170426  20191210  Wells Fargo Bank, N.A.  Secret sharing information management and security system 
US20200125741A1 (en) *  20171031  20200423  Alibaba Group Holding Limited  Data storage nodes collaboration and data processing for data statistical analysis 
US11178116B2 (en) *  20180511  20211116  Security First Corp.  Secure data parser method and system 
Families Citing this family (8)
Publication number  Priority date  Publication date  Assignee  Title 

US8059816B2 (en) *  20050513  20111115  Temple University Of The Commonwealth System Of Higher Education  Secret sharing technique with low overhead information content 
JP2008103936A (en) *  20061018  20080501  Toshiba Corp  Secret information management device, and secret information management system 
KR101213156B1 (en)  20061221  20121217  삼성전자주식회사  Distributed rivest shamir adleman signature method and signature generative node 
US8913741B2 (en) *  20090331  20141216  France Telecom  Method for performing a cryptographic task in an electronic hardware component 
US8731203B2 (en) *  20120213  20140520  Alephcloud Systems, Inc.  Securing a secret of a user 
EP3161993A1 (en) *  20140627  20170503  Koninklijke Philips N.V.  Device for determining a shared key 
CN113498591A (en) *  20181221  20211012  01公报实验室公司  Password system and method 
CN110830520B (en) *  20200113  20200417  中国人民解放军国防科技大学  Robust and reliable edge storage method and system for Internet of things 
Citations (9)
Publication number  Priority date  Publication date  Assignee  Title 

US4682333A (en) *  19840628  19870721  Mitsubishi Denki Kabushiki Kaisha  Decoder for decoding a twostage encoded code 
US5987129A (en) *  19960221  19991116  Card Call Service Co., Ltd.  Method of sharing cryptokey 
US6173400B1 (en) *  19980731  20010109  Sun Microsystems, Inc.  Methods and systems for establishing a shared secret using an authentication token 
US20020164033A1 (en) *  20010306  20021107  Sanguthevar Rajasekaran  Efficient techniques for sharing a secret 
US20030147535A1 (en) *  20020129  20030807  Mehrdad Nadooshan  Method and apparatus for secure key management using multithreshold secret sharing 
US6625775B1 (en) *  19981210  20030923  Samsung Electronics Co., Ltd.  Encoder/decoder with serial concatenated structure in communication system 
US20030233573A1 (en) *  20020618  20031218  Phinney Thomas L.  System and method for securing network communications 
US20040001605A1 (en) *  20020628  20040101  Ramarathnam Venkatesan  Watermarking via quantization of statistics of overlapping regions 
US6707397B1 (en) *  20021024  20040316  Apple Computer, Inc.  Methods and apparatus for variable length codeword concatenation 
Family Cites Families (4)
Publication number  Priority date  Publication date  Assignee  Title 

JP2002140631A (en) *  20001101  20020517  Nec Corp  Electronic commercial transaction system 
US7224806B2 (en) *  20001113  20070529  Thomson Licensing  Threshold cryptography scheme for conditional access systems 
US7200752B2 (en) *  20001113  20070403  Thomson Licensing  Threshold cryptography scheme for message authentication systems 
CN1365214A (en) *  20010109  20020821  深圳市中兴集成电路设计有限责任公司  Cipher key managing method based on public cipher key system 

2003
 20031008 KR KR1020030070026A patent/KR100561846B1/en not_active IP Right Cessation

2004
 20041008 CN CNB2004100471523A patent/CN100466514C/en not_active Expired  Fee Related
 20041008 US US10/960,278 patent/US7551740B2/en active Active
 20041008 JP JP2004296058A patent/JP2005117670A/en active Pending
Patent Citations (9)
Publication number  Priority date  Publication date  Assignee  Title 

US4682333A (en) *  19840628  19870721  Mitsubishi Denki Kabushiki Kaisha  Decoder for decoding a twostage encoded code 
US5987129A (en) *  19960221  19991116  Card Call Service Co., Ltd.  Method of sharing cryptokey 
US6173400B1 (en) *  19980731  20010109  Sun Microsystems, Inc.  Methods and systems for establishing a shared secret using an authentication token 
US6625775B1 (en) *  19981210  20030923  Samsung Electronics Co., Ltd.  Encoder/decoder with serial concatenated structure in communication system 
US20020164033A1 (en) *  20010306  20021107  Sanguthevar Rajasekaran  Efficient techniques for sharing a secret 
US20030147535A1 (en) *  20020129  20030807  Mehrdad Nadooshan  Method and apparatus for secure key management using multithreshold secret sharing 
US20030233573A1 (en) *  20020618  20031218  Phinney Thomas L.  System and method for securing network communications 
US20040001605A1 (en) *  20020628  20040101  Ramarathnam Venkatesan  Watermarking via quantization of statistics of overlapping regions 
US6707397B1 (en) *  20021024  20040316  Apple Computer, Inc.  Methods and apparatus for variable length codeword concatenation 
Cited By (29)
Publication number  Priority date  Publication date  Assignee  Title 

US20130276074A1 (en) *  20041025  20131017  Security First Corp.  Secure data parser method and system 
US9906500B2 (en) *  20041025  20180227  Security First Corp.  Secure data parser method and system 
US9992170B2 (en) *  20041025  20180605  Security First Corp.  Secure data parser method and system 
US20150261973A1 (en) *  20041025  20150917  Security First Corp.  Secure data parser method and system 
US9935923B2 (en)  20041025  20180403  Security First Corp.  Secure data parser method and system 
US20120221854A1 (en) *  20041025  20120830  Security First Corp.  Secure data parser method and system 
US9985932B2 (en) *  20041025  20180529  Security First Corp.  Secure data parser method and system 
US20060280203A1 (en) *  20050614  20061214  Fujitsu Limited  Communication control apparatus and communication control method 
US7693063B2 (en) *  20050614  20100406  Fujitsu Limited  Communication control apparatus and communication control method 
US10452854B2 (en)  20051118  20191022  Security First Corp.  Secure data parser method and system 
US10108807B2 (en)  20051118  20181023  Security First Corp.  Secure data parser method and system 
US20110091033A1 (en) *  20080520  20110421  Irdeto B.V.  Cryptographic system 
US8724802B2 (en) *  20080520  20140513  Irdeto Corporate B.V.  Cryptographic system 
US20100151724A1 (en) *  20081215  20100617  Kondas Shawn J  Wall panel electrical distribution system 
US7922508B2 (en)  20081215  20110412  Group Dekko, Inc.  Electrical distribution system with a jumper assembly having a telescopic slider 
US10068103B2 (en)  20100331  20180904  Security First Corp.  Systems and methods for securing data in motion 
US9589148B2 (en)  20100331  20170307  Security First Corp.  Systems and methods for securing data in motion 
US9785785B2 (en)  20100920  20171010  Security First Corp.  Systems and methods for secure data sharing 
FR2985626A1 (en) *  20120330  20130712  France Telecom  Method for transmission of confidential data divided into segments to e.g. fixed terminals, in network gaming field, involves decoding segments actually transmitted by error correction code to find value of segments of data 
US9916456B2 (en)  20120406  20180313  Security First Corp.  Systems and methods for securing and restoring virtual machines 
EP2978161A3 (en) *  20140721  20160420  Ercom Engineering Réseaux Communications  METHOD FOR SAVING A USERýS SECRET AND METHOD FOR RESTORING A USERýS SECRET 
EP3340531A1 (en) *  20140721  20180627  Ercom  Method for restoring a user's secret 
FR3024002A1 (en) *  20140721  20160122  Ercom Engineering Reseaux Comm  METHOD FOR SECURING A SECRET OF A USER AND METHOD FOR RESTORING A SECRET OF A USER 
US20160021101A1 (en) *  20140721  20160121  Ercom Engineering Reseaux Communications  Method for backing up a user secret and method for recovering a user secret 
US10505723B1 (en) *  20170426  20191210  Wells Fargo Bank, N.A.  Secret sharing information management and security system 
US11115197B1 (en)  20170426  20210907  Wells Fargo Bank, N.A.  Secret sharing information management and security system 
US20200125741A1 (en) *  20171031  20200423  Alibaba Group Holding Limited  Data storage nodes collaboration and data processing for data statistical analysis 
US10860728B2 (en) *  20171031  20201208  Advanced New Technologies Co., Ltd.  Data storage nodes collaboration and data processing for data statistical analysis 
US11178116B2 (en) *  20180511  20211116  Security First Corp.  Secure data parser method and system 
Also Published As
Publication number  Publication date 

US7551740B2 (en)  20090623 
CN100466514C (en)  20090304 
JP2005117670A (en)  20050428 
KR100561846B1 (en)  20060316 
KR20050034184A (en)  20050414 
CN1630231A (en)  20050622 
Similar Documents
Publication  Publication Date  Title 

US7551740B2 (en)  Weighted secret sharing and reconstructing method  
He et al.  Multistage secret sharing based on oneway function  
EP0920753B1 (en)  Public key cryptosystem method and apparatus  
US7382762B2 (en)  Method and system for distributed certificate management in adhoc networks  
Hendricks et al.  Verifying distributed erasurecoded data  
US20170104590A1 (en)  Method and Apparatus for Error Correcting Code Based Public Key Encryption Schemes  
US9191199B2 (en)  Method and apparatus for publickey cryptography based on error correcting codes  
Aggarwal et al.  A new publickey cryptosystem via Mersenne numbers  
Hemenway et al.  Noncommitting encryption from Φhiding  
Liu et al.  A practical protocol for advantage distillation and information reconciliation  
US7532724B2 (en)  Method for encrypting and decrypting data for multilevel access control in an adhoc network  
Rajabi et al.  A verifiable threshold secret sharing scheme based on lattices  
US20130010953A1 (en)  Encryption and decryption method  
US20090089744A1 (en)  Method and apparatus for generating errorcorrecting and errordetecting codes using zerodivisors and units in group rings  
Lee et al.  Modified pqsigRM: RM CodeBased Signature Scheme  
Ye et al.  Efficient fuzzy matching and intersection on private datasets  
Hooshmand et al.  Secret key cryptosystem based on polar codes over binary erasure channel  
Lee et al.  Ciphertextonly attack on linear feedback shift registerbased EsmaeiliGulliver cryptosystem  
Barreto et al.  A panorama of postquantum cryptography  
Lakshmi et al.  A secure channel code‐based scheme for privacy preserving data aggregation in wireless sensor networks  
Araki et al.  A simple and efficient secret sharing scheme secure against cheating  
Bu et al.  RASSS: a perfidyaware protocol for designing trustworthy distributed systems  
Smart  Secret sharing schemes  
EP0605047B1 (en)  Method for blockwise encryption/decryption using linear algebraic codes  
Sayed  Coset decomposition method for decoding linear codes 
Legal Events
Date  Code  Title  Description 

AS  Assignment 
Owner name: SAMSUNG ELECTRONICS CO., LTD., KOREA, REPUBLIC OF Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LEE, KYUNGHEE;JUNG, TAECHUL;KROUK, EVGENY;AND OTHERS;REEL/FRAME:022313/0531;SIGNING DATES FROM 20050112 TO 20050117 

STCF  Information on status: patent grant 
Free format text: PATENTED CASE 

CC  Certificate of correction  
FPAY  Fee payment 
Year of fee payment: 4 

FPAY  Fee payment 
Year of fee payment: 8 

MAFP  Maintenance fee payment 
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 12 