The present application relates to a steganography method and a steganography apparatus using the same. According to the steganography method of the present application and the steganography apparatus using the same, they can simplify a data refinement process compared to the supervised learning method as AI learns a large amount of data related to steganography encoding and decoding by itself, can generate a high-quality stego video close to the cover video to improve the imperceptibility of hidden information as the generator and discriminator conduct mutual learning, can hide the message in the images and/or sounds according to the learning method to secure a high-capacity cache, and can secure robustness against third-party detection, monitoring, and removal attacks when learning the detection and avoidance methods of physical and technical detection systems (monitoring equipment, wiretapping equipment and security equipment, etc.). In addition, according to the steganography method of the present application, it can simplify a data refinement process compared to the supervised learning method as AI learns a large amount of data related to steganography decoding by itself, and can recover the hidden message close to the original hidden message to improve perceptibility of hidden information as the generator and the discriminator conduct mutual learning.

A method for the interception-proof transmission of at least one cryptographic parameter from a user to an encrypted offline storage medium, comprising steps of: cloaking an upward portion of a substrate with an upper plate, characterized in that said upper plate comprises a multitude of indicia, wherein each indicium has a corresponding manipulation indicator; sequentially positioning a manipulation apparatus over one or more of the manipulation indicators; mechanically manipulating the substrate, after each sequential positioning of the manipulation apparatus, using said manipulation apparatus, characterized in that the manipulation indicator of the desired indicium overlaps with one mechanical manipulation unit of the substrate; and deconstructing said substrate in two or more complementary units, characterized in that said complementary units each comprises at least one mechanical manipulation unit administered by the manipulation apparatus.

A method for the interception-proof transmission of at least one cryptographic parameter from a user to an encrypted offline storage medium, comprising steps of: cloaking an upward portion of a substrate with an upper plate, characterized in that said upper plate comprises a multitude of indicia, wherein each indicium has a corresponding manipulation indicator; sequentially positioning a manipulation apparatus over one or more of the manipulation indicators; mechanically manipulating the substrate, after each sequential positioning of the manipulation apparatus, using said manipulation apparatus, characterized in that the manipulation indicator of the desired indicium overlaps with one mechanical manipulation unit of the substrate; and deconstructing said substrate in two or more complementary units, characterized in that said complementary units each comprises at least one mechanical manipulation unit administered by the manipulation apparatus.

A registration device (200) generates an encryption keyword by encrypting a keyword with a registration key, generates an index including the encryption keyword and identification information which identifies a corresponding ciphertext, generates a conversion key from the registration key and a search key, and registers a plurality of ciphertexts, the index, and the conversion key in a server device (400). A search device (300) generates a search query by encrypting a keyword, and transmits the search query to the server device (400). The server device (400) generates a re-encryption keyword by re-encrypting the search query with the registered conversion key, searches the registered index with the re-encryption keyword, acquires, from the index, the identification information if the encryption keyword is obtained as a search result, extracts a ciphertext identified by the identification information from the registered plurality of ciphertexts, and transmits the extracted ciphertext to the search device (300).

A registration device (200) generates an encryption keyword by encrypting a keyword with a registration key, generates an index including the encryption keyword and identification information which identifies a corresponding ciphertext, generates a conversion key from the registration key and a search key, and registers a plurality of ciphertexts, the index, and the conversion key in a server device (400). A search device (300) generates a search query by encrypting a keyword, and transmits the search query to the server device (400). The server device (400) generates a re-encryption keyword by re-encrypting the search query with the registered conversion key, searches the registered index with the re-encryption keyword, acquires, from the index, the identification information if the encryption keyword is obtained as a search result, extracts a ciphertext identified by the identification information from the registered plurality of ciphertexts, and transmits the extracted ciphertext to the search device (300).

A privacy-preserving, mutual PUF-based authentication protocol that uses soft data to exchange and correlate Helper Data bitstrings instead of PUF response bitstrings as a means of authenticating chips to prevent attacks.

This document describes example methods, devices, and computing systems to rank a data string into a ranking value, and de-rank a second value representative of a variation of the ranking value (e.g., cipher value) into a second data string (e.g., cipher string), using a tree data-structure. The tree data-structure defines a domain of values representative of all variations of a set of characters that satisfy a format within which the data string is defined. The ranking value is identified with respect to a first offset value calculated for individual characters of the data string relative to the domain of values of the tree data-structure. The second value is de-ranked into a second data string of individual characters identified with respect to a second offset value calculated in the domain of values of the tree data-structure relative to the second value. This method may be performed using the tree data-structure to rank a data string into a ranking value, and de-rank a cipher version of the ranking value into a cipher string. Similarly, this method may be performed to accomplish the reverse process of ranking a cipher string to a ranking value, and de-ranking a decrypted version of the ranking value to a decrypted data string.