Electronics and Telecommunications Research Institute

Korea University Research and Business Foundation

Ku Young Chang

Nam-Su Jho

Do Won Hong

Taek-Young Youn

Hyun Sook Cho

Kyo Il Chung

Taek Young Youn

Nam Su Jho

Keonwoo Kim

Jung Yeon Hwang

Ju Young Kim

Juyoung Kim

Jesang Lee

Seokhie Hong

Yong Je Choi

Mun Kyu Lee

Hang Rok Lee

Ju Sung Kang

Jaechul Sung

Jinkeon Kang

A method and an apparatus for generating a secret key for encrypted communication using a synchronized neural network, which includes: generating initial codewords based on a bit string of weight values of the synchronized neural network and transmitting a first partial codeword of the initial codewords to a device of another party; receiving a second partial codeword generated by the device of the other party and combining final codewords based on the second partial codeword received from the device of the party and the bit string of the weight values; performing an error correction on the combined final codewords and transmitting first restoration success information according to the error correction to the device of the other party; and receiving second restoration success information from the device of the other party and generating the secret key based on the restoration success information of the device of the other party, are provided.

Method and apparatus for generating secret key based on neural network synchronization

A method of providing a search index based on a Bloom filter in a distributed data sharing environment based a block chain includes generating, by a data generating device, Bloom filters used as the search index on the basis of a hash value calculated by applying a hash function to a keyword set for searching for data which is to be shared, generating, by a block providing server, a new block on the basis of the Bloom filters and the data received from the data generating device and performing proof of work (PoW) on the new block, for adding the new block to the block chain, and distributing, by a block distributing server, block chain data including the new block added to the block chain.

System for data sharing platform based on distributed data sharing environment based on block chain, method of searching for data in the system, and method of providing search index in the system

The present invention relates to a method and device for verifying data ownership. The user may verify whether the server actually owns the data to be uploaded by him, and the server may simultaneously verify whether the user actually owns the data.

Method for mutual verifying of data ownership

Provided are a method and a system for an additive homomorphic encryption scheme with operation error detection functionality. A plaintext is obtained by decrypting a ciphertext encrypted based on a homomorphic encryption technique and subjected to an operation and lower setting bits corresponding to additional secret information included in a final private-key are extracted as plaintext information from the acquired plaintext. An operation error check is performed on the remaining bits other than the lower setting bits in the acquired plaintext.

Method and system for additive homomorphic encryption scheme with operation error detection functionality

In a client, an encryption key is created using plain text data, a first tag is created using the encryption key, and the plain text data are encrypted under the encryption key to create encrypted data. The first tag is transmitted to the server to confirm whether the encrypted data is duplicated and after transmitting the first tag, the encrypted data is transmitted to the server in accordance with the request of the encrypted data from the server.

Method and apparatus for deduplicating encrypted data

The present invention relates to a technique which provides a function of compressed encryption large pieces of plaintext information in a single ciphertext in order to improve a space efficiency of the encryption data which occupies most of a storage space to design an efficient SHE technique which is a base of the FHE technique design. More specifically, the present invention relates to a technique which is designed to improve a structure in which only one bit is encrypted/decrypted in the technique of the prior art to encrypt/decrypt multiple bit information to improve the space efficiency for storing a ciphertext.

System and method for providing compressed encryption and decryption in homomorphic encryption based on integers

An integrated cryptographic apparatus providing confidentiality and integrity includes an integrated cryptographic module including confidentiality and integrity. Further, the integrated cryptographic apparatus includes a hash function unit for detecting whether a message is modified by using the integrated cryptographic module. Furthermore, the integrated cryptographic apparatus includes a block cipher unit for constructing a data encryption algorithm by using the integrated cryptographic module.

Integrated cryptographic module providing confidentiality and integrity

A multi-user searchable encryption system includes a key generation center to issue a private secret key to a user and trace information regarding a user who has generated an index, and a user terminal device to generate an index for searching for a database using the private secret key. The multi-user searchable encryption system includes a database (DB) server that verifies the index generated by the user terminal device and searches for corresponding data to the verified index.

Multi-user searchable encryption system and method with index validation and tracing

Provided are a key establishment method and system using commutative linear functions. In the method, a server defines a set of linear functions that use elements of a first finite field as coefficients and satisfy a commutative rule, selects a first linear function from the set, and selects a predetermined element from a second finite field. Next, the server selects a second linear function corresponding to each of nodes from the set, generates a predetermined combination function based on the first and second linear functions, generates a value of the second linear function using the selected element as a factor, and transmits the combination function and the value of the second linear function to a corresponding node. Each node receives the value of the second linear function from a server, exchanges the received values with the other nodes, computes a value using the exchanged value as a factor of the combination function, and establishes the computed value as a shared key between the nodes. Therefore, each node can perform key establishment with a small amount of computation and low memory consumption, while guaranteeing end-to-end security.

Key establishment method and system using commutative linear function

An apparatus and method for hybrid multiplication in GF(2) by which trade-off between the area and the operation speed of an apparatus for a hybrid multiplier in finite field GF(2) can be achieved are provided. The apparatus for hybrid multiplication includes: a matrix Z generation unit generating [m&#xd7;k] matrix Z for performing a partial multiplication of a(x) and b(x), by dividing b(x) by k bits (k&#x2266;&#x250c;m/2&#x2510;), when multiplication of m-bit multiplier a(x) and m-bit multiplicand b(x) is performed from [(m+k&#x2212;1)&#xd7;k] coefficient matrix of a(x) in GF(2); a partial multiplication unit performing the partial multiplication &#x250c;m/k&#x2510;k&#x2212;1 times in units of rows of the matrix Z to calculate an (&#x250c;m/k&#x2510;k&#x2212;1)-th partial multiplication value and a final result value of the multiplication; and a reduction unit receiving the (&#x250c;m/k&#x2510;k&#x2212;1)-th partial multiplication value fed back from the partial multiplication unit and performing reduction of the value in order to obtain a partial multiplication value next to the (&#x250c;m/k&#x2510;k&#x2212;1)-th partial multiplication value.

[object Object]

A method and apparatus for generating a keystream are provided. The method includes: (a) receiving a bitstream comprised of at least 4 bits; (b) selecting at least two bits from the received bitstream; (c) generating an operation value by performing a predetermined bitwise operation on the bits selected in (b); and (d) determining whether to discard the received bitstream or to output the rest of the received bitstream not selected in (b) according to the operation value. The method and apparatus for generating a keystream are expected to be suitable for a ubiquitous computing and network environment and to provide high security or high efficiency.

Growing community of inventors

Daejeon, South Korea

Ku Young Chang