Abstract: A method of performing cryptographic key exchange while overcoming a malicious adversary party using a multi-party computation (MPC) process performed by the multiple parties, where the parties hold initial shares of a secret used an as exponentiation of the key exchange, where the parties do not reveal the initial shares during the entire process, and where arithmetical computations are performed on the initial shares and on random values outputted during MPC processes.

Abstract: A method for decoding a video according to the present invention may comprise: determining whether to divide a current block with quad tree partitioning, and dividing the current block into four partitions based on a vertical line and a horizontal line when it is determined that the current block is divided with the quad tree partitioning.

Abstract: A method for decoding a video according to the present invention may comprise: determining whether to divide a current block with quad tree partitioning, and dividing the current block into four partitions based on a vertical line and a horizontal line when it is determined that the current block is divided with the quad tree partitioning.

Abstract: Provided is a secret search device including an arithmetic processing unit configured to speed up secret search processing by, when the secret search processing is performed by executing a pairing operation relating to each element of an encrypted tag and each element of a trapdoor, and when the pairing operation is executed by using a pre-calculation table stored in a storage unit for each element to be used in the pairing operation. The arithmetic processing unit is configured to execute, based on information on a free space usable for the pre-calculation table, size adjustment of the pre-calculation table such that the pre-calculation table fits in the free space.

Abstract: A method for decoding a video according to the present invention may comprise: determining whether to divide a current block with quad tree partitioning, and dividing the current block into four partitions based on a vertical line and a horizontal line when it is determined that the current block is divided with the quad tree partitioning.

Abstract: The invention is directed to a system that enables an authentication process that involves secure multi-party computation. The authentication process can be performed between a user device operated by a user and an access device. The user device and the access device may conduct the authentication process such that enrollment information and authentication information input by the user is not transmitted between the devices. Instead, the user device may determine and utilize obfuscated values associated with the authentication information. The user device may also determine an obfuscated authentication function that can be utilized to determine an authentication result without revealing enrollment information and authentication information associated with the user. The user can be authenticated based on the authentication result.

Abstract: A system, method, and computer readable storage medium configured for delivering services from a server to ensure multimedia content control by content providers (i.e. reduce piracy) and to ensure privacy by content users is described. The method begins with executing at least a portion of a content media player application to the device using a zero-knowledge protocol to ensure privacy of the user. Examples of zero-knowledge verifiable computing are succinct computational integrity and privacy (SCIP) protocol, zero-knowledge succinct non-interactive argument of knowledge (zk-snark) protocol, and probabilistically checkable proof (PCP) protocol. The content media player application includes digital right management technology using zero-knowledge verifiable computing to enforce usage conditions on the multimedia content. A response is received from the user device that the content media player application has executed on the user device.

Abstract: A trusted node, for quantum key distribution, has a quantum key engine, a quantum key controller and a trusted node controller. The quantum key engine exchanges quantum keys. The quantum key controller directs encryption and decryption. The trusted node controller directs the quantum key controller and the quantum key engine, and has no direct access to keys and data protected by the system, including unencrypted quantum keys.

Abstract: Systems and methods for performing modular inversion operations in a manner protected from external monitoring attacks. An example method comprises: determining, by a processor, a first masked value based on a public cryptographic key and a first random integer value; determining a second masked value based on the public cryptographic key and a second random integer value, and determining, based on the first masked value and the second masked value, a private cryptographic key represented by a modular inversion of the public cryptographic key.

Abstract: The disclosure provides a blockchain-based data processing method, a blockchain-based data processing apparatus, an electronic device, and a medium, and relates to a field of blockchain technologies. The method includes: obtaining a delay transaction request and triggering execution of the delay transaction request; during the execution of the delay transaction request, homomorphically encrypting determined data to be disclosed with a delay, to generate delay transaction data containing encrypted delay data, and storing the delay transaction data on an uplink; and when set delay disclosure conditions are met, decrypting the delay transaction data.

Abstract: An integrated circuit including a set of security modules configured to implement an asymmetric cryptography operation, the set of modules including a conditional exchange module configured to exchange first and second vectors used to manipulate input bits of a secret key, the conditional exchange module being suitable for applying an exchange formula including a combination of a condition of the input bit with the first and second vectors so that the latter are interchanged only if the condition of the input bit is equal to ‘1’, the conditional exchange module including a masking module suitable for making use of at least one random number to mask said exchange formula before it is applied.

Abstract: Technologies disclosed herein provide cryptographic computing with cryptographically encoded pointers in multi-tenant environments. An example method comprises executing, by a trusted runtime, first instructions to generate a first address key for a private memory region in the memory and generate a first cryptographically encoded pointer to the private memory region in the memory. Generating the first cryptographically encoded pointer includes storing first context information associated with the private memory region in first bits of the first cryptographically encoded pointer and performing a cryptographic algorithm on a slice of a first linear address of the private memory region based, at least in part, on the first address key and a first tweak, the first tweak including the first context information. The method further includes permitting a first tenant in the multi-tenant environment to access the first address key and the first cryptographically encoded pointer to the private memory region.

Abstract: A random flux of rising bubbles generates a fluctuating electrical current that is processed into a high-quality bit stream. Any stream of fully or mildly randomized bits is measured for its degree of randomness, and that randomness is amplified or attenuated as the case may be. Impact on ciphers and cyber security tools that rely on randomness.

Abstract: The present invention relates to a method secured against side channel attacks performing an arithmetic operation of a cryptographic algorithm mixing Boolean and arithmetic operations, wherein said method is performed by a cryptographic device comprising a processing system having at least one hardware processor, and said operation has a first value (x) and a second value (y) as operands, comprising: —obtaining (S1) a first masked value (x?), a second masked value (y?), a first Boolean mask (rx), a second Boolean mask (ry), said first masked value (x?) resulting from masking said first value (x) by said first Boolean mask (rx) by performing a Boolean exclusive OR (XOR) operation between said first value (x) and said first Boolean mask (rx), and said second masked value (y?) resulting from masking said second value (y) by said second Boolean mask (ry) by performing a Boolean exclusive OR (XOR) operation between said second value (y) and said second Boolean mask (ry), —performing (S2) in any order a plurality o

Abstract: Disclosed are a data processing method and apparatus for a blockchain, and a medium. The data processing method for the blockchain is applied to a blockchain node. The method includes: obtaining a transaction request for creating a synchronizing group; based on the transaction request for creating the synchronizing group, determining one or more sequential blocks from a first block to a current block as one or more synchronizing blocks of the synchronizing group; determining a synchronizing signature of the synchronizing group based on the one or more synchronizing blocks; and recording the synchronizing signature as transaction data in the current block.

Abstract: Some embodiments are directed to an electronic computation device (100) arranged for obfuscated execution of a multiplication. The device comprises a storage (120) arranged for storing multiple variables used in the execution of an arithmetic operation, a variable (x: y; 2) of the multiple variables being represented as multiple multiplicative shares (X=(x0, x1, . . . , xm?1); Y=(y0, y1, . . . , ym?1); 20), said multiplicative shares being represented in the storage as multiple additive shares (xi=(xi,0,xi,1, . . . , xi,n?1); Yi=(yi,0,yi,1, . . . , yi,n?1); 210, 220).

Abstract: Detecting data corruption in a storage system includes examining portions of the data for encryption anomalies and providing an indication in response to detecting an encryption anomaly. The encryption anomalies may be based on entropy of the data. The entropy of the data may vary based on an inherent nature of the data. One of the portions of data may be deemed to be encrypted in response to an entropy value exceeding a predetermined threshold. The predetermined threshold may be based on prior data accesses. The predetermined threshold may be determined using machine learning. Portions of the data may be examined for encryption anomalies during data accesses. Data accesses may be suspended in response to detecting an encryption anomaly. Encryption anomalies may include data that is flagged to be encrypted not being detected as being encrypted and/or data that is flagged to not be encrypted being detected as being encrypted.

Abstract: Certain aspects of the present disclosure provide techniques for performing computations on encrypted data. One example method generally includes obtaining, at a computing device, encrypted data, wherein the encrypted data is encrypted using fully homomorphic encryption and performing at least one computation on the encrypted data while the encrypted data remains encrypted. The method further includes identifying a clear data operation to perform on the encrypted data and transmitting, from the computing device to a server, a request to perform the clear data operation on the encrypted data, wherein the request includes the encrypted data. The method further includes receiving, at the computing device in response to the request, encrypted output from the server, wherein the encrypted output is of the same size and the same format for all encrypted data transmitted to the server.

Abstract: Embodiments of the application provide a method, apparatus, and electronic device for implementing blockchain-based transactions. The method comprises: determining a transaction amount to be remitted from a remitter's blockchain account into a receiver's blockchain account, wherein a commitment of the remitter's balance is recorded with the remitter's blockchain account in a blockchain, a commitment of the receiver's balance is recorded with the receiver's blockchain account in the blockchain; obtaining a commitment of the transaction amount by using the homomorphic encryption algorithm according to the transaction amount; and submitting to the blockchain a transaction comprising information of the remitter's and the receiver's blockchain accounts, and the commitment of the transaction amount, for the commitment of the transaction amount to be deducted from the commitment of the remitter's balance and the commitment of the transaction amount to be added to the commitment of the receiver's balance.

Abstract: A bit-decomposition secure computation apparatus uses r1, r2, and r3 satisfying w=r1+r2+r3 mod 2{circumflex over (?)}n as share information of (2, 3) threshold type RSS (Replicated Secret Sharing) stored in a share value storage apparatus, and includes an addition sharing part that sums two values out of the share information by modulo 2{circumflex over (?)}n arithmetic and distributes the sum using (2, 3) type RSS; and a full adder secure computation part that adds the value generated by the addition sharing part by distributing the sum of the two values to share information of one remaining value other than the two values used by the addition sharing part for each digit by using secure computation of a full adder.

Abstract: Methods and systems are disclosed for binding a payment element in a mobile wallet operating on a mobile device with a payee. The mobile wallet, can for example, receive an indication from a point of sale (POS) device that a transaction has been completed with a payee associated with the POS device, using a payment element of the mobile wallet. The mobile wallet can query a payment database table with an identifier for the payee and an identifier for the payment element to determine if the payment element has previously been used to complete transactions with the payee. The mobile wallet can bind the payment element to the payee if the payment element has previously been used to complete transactions with the payee and if the payment element is to be bound to the payee. Other systems, methods and apparatuses are also described.

Abstract: The Antifraud Resilient Transaction Identifier Datastructure Apparatuses, Methods and Systems (“ARTID”) transforms PIN, unique user identifying device datastructure inputs via ARTID components into secure payment authorization outputs. The ARTID includes a virtual secure element datastructure transaction apparatus, comprising, a memory, a component collection in the memory, and a processor disposed in communication with the memory, and configured to issue a plurality of processing instructions from the component collection stored in the memory. ARTID includes instructions to: obtain request to generate a tamper resistant asset account from a requestor, and instantiate a new tamper resistant asset account, wherein the account is populated with the requestor identifier, unique requestor device identifier, a secure cryptographic element for the tamper resistant account.

Abstract: Efficient polynomial multiplication for Accelerated Fully Homomorphic Encryption (FHE). An efficient method for large integer and polynomial multiplication in a ring using negacyclic convolution and discrete Galois transform with arbitrary primes is described. The method is adapted to work with arbitrary primes that support Gaussian arithmetic. Dealing with non-Gaussian primes gives rise to another problem of how to find primitive roots of unity and of (i). An efficient solution to find those roots of interest is provided.

Abstract: Some embodiments are directed to a dealer device for batch-wise provisioning of preprocessing information for a multiparty computation and an evaluator device for batch-wise distributed verification with one or more other evaluator devices of the preprocessing information. The preprocessing information comprises multiple random values and multiple message authentication codes for blinding and integrity checking respectively in the multi-party computation. The multiple random values and a set of proof values together define a checking polynomial. The dealer device computes proof values wherein the checking polynomial is identical to zero. The evaluator device obtains secret-shares of the random values, proof values, and message authentication codes.

Abstract: A processing apparatus is provided comprising a multiprocessor having a multithreaded architecture. The multiprocessor can execute at least one single instruction to perform parallel mixed precision matrix operations. In one embodiment the apparatus includes a memory interface and an array of multiprocessors coupled to the memory interface. At least one multiprocessor in the array of multiprocessors is configured to execute a fused multiply-add instruction in parallel across multiple threads.

Abstract: Methods, systems and computer program products for protection of content repositories using dynamic watermarking are provided. Aspects include receiving a request for a code stored in a content repository from a user and identifying a plurality of candidate locations in the code to insert watermarks. Aspects also include generating one or more watermarks and inserting the one or more watermarks in a subset of the plurality of candidate locations in the code. Aspects further include providing the code, including the one or more watermarks, to the user.

Abstract: In an embodiment, an image reception system is communicatively coupled to an image analysis system and is configured to receive a digital image and analyze the pixels of the digital image to determine one or more regions in the digital image. For each region in the one or more regions in the digital image, the image analysis system recognizes the content in the region. A document creation system communicatively coupled to the image analysis system is configured to create a digital document based on the recognized content for the one or more regions. In some embodiments, the image analysis system is further configured to analyze the digital image to detect one or more of the following: region markers, tables, headers.

Abstract: An encryption device (10) is an encryption device in authentication encryption. A key generation unit (21) generates a key K of an encryption function E of a block cipher, in accordance with an initial parameter N. A hash calculation unit (22) calculates a hash value msk with an internal parameter ctr as an input. An encryption unit (23) generates a ciphertext c of the message m by using the encryption function E, with a key K generated by the key generation unit (21), a hash value msk calculated by the hash calculation unit (22), and a message m as inputs.

Abstract: Examples discussed herein disclose, among other things, an encrypting device. The encrypting device may include a format preserving encryptor to obtain a plaintext, obtain a key from a plurality of keys stored in a key database, and encrypt the plaintext using the key to produce a ciphertext having a length of the plaintext. The encrypting device may also include a key reference embedder to obtain a key reference associated with the key, and generate an extended ciphertext by adding to the ciphertext a set of characters associated with the key reference, such that the key reference can be determined based on the extended ciphertext.

Abstract: A method for implementing blockchain-based transactions comprises: determining a transaction amount to be remitted from a blockchain account of a remitter into a blockchain account of a receiver, wherein the blockchain account of the remitter records a homomorphic encryption ciphertext of the remitter's balance, the blockchain account of the receiver records a homomorphic encryption ciphertext of the receiver's balance; generating a homomorphic encryption ciphertext of the transaction amount with respect to the remitter and a homomorphic encryption ciphertext of the transaction amount with respect to the receiver; and submitting to the blockchain a transaction for the homomorphic encryption ciphertext of the transaction amount with respect to the remitter to be subtracted from the homomorphic encryption ciphertext of the remitter's balance and for the homomorphic encryption ciphertext of the transaction amount with respect to the receiver to be added to the homomorphic encryption ciphertext of the receiver's

Abstract: A method for performing a fully homomorphic encryption on a plain text is disclosed. The method includes computing a first subfunction based on a first computationally intractable problem and the plain text to generate a first section of a cipher text. The method also includes computing a second subfunction based on a second computationally intractable problem and the plain text to generate a second section of the cipher text. The method further includes generating a fully homomorphic function by integrating the first subfunction and the second subfunction. The method further includes encrypting the plain text to a fully homomorphic cipher text using the fully homomorphic function.

Abstract: A system and a method for protecting code are provided. Extraction of code to be protected takes place during an object-to-object transformation and that code is replaced with fake binary code. The extracted code to be protected may then be encrypted or otherwise obscured and stored in a separate region of an object file. A prior source-to-source file transformation can be provided to isolate and mark the code to be protected, and to inject additional source code to handle later decryption.

Abstract: The method of identity authentication at the user is provided to prove to the certificate authority that a key is owned by a user. The method can comprise selecting a certain number of keys from a set of keys of the user, obtaining a hash value of a correspondence between each key in the certain number of keys and a user identifier of the user respectively, and transmitting the obtained hash values to the certificate authority, and after receiving from the certificate authority a notification regarding a first subset of hash values, sending keys corresponding to the first subset of hash values as a first subset of keys to the certificate authority. The first subset of hash values can be selected by the certificate authority from the obtained hash values. Zero know ledge proof can be achieved with this technical solution.

Abstract: A computer-implemented method includes: storing an encryption public key that is associated with a group of nodes, each node in the group associated with a private key share, the private key shares associated with a threshold private key reconstruction scheme for the group to allow an encryption private key associated with the encryption public key to be determined from at least a threshold of the private key shares; iteratively obtaining a plurality of indicators provided by a plurality of nodes of the group, each of the indicators representing one of an encryption private key share or a dummy signal; and identifying the encryption private key by iteratively: i) selecting a subset of the indicators; ii) calculating a possible shared secret; and iii) evaluating each possible shared secret against the encryption public key to determine whether the possible shared secret is the encryption private key. The invention is suited for implementation on a blockchain.

Abstract: A calculation is performed on a first number and a second number. For each bit of the second number a first function is performed. The first function inputs include contents of a first register, contents of a second register and the first number. A result of the first function is placed in a third register. For each bit of the second number, a second function is performed which has as inputs contents of the third register and the contents of a selected one of the first and the second register according to a state of a current bit of the second number. A result of the second function is stored in the selected one of the first and second register.

Abstract: An encryption method includes: calculating a second random matrix using a first random matrix and a secret key, and generating a ciphertext corresponding to a message using the second random matrix. The generating of the ciphertext includes: performing a rounding process for sending the generated ciphertext to a smaller modulus area. The generating of the ciphertext includes performing message encryption without Gaussian sampling.

Abstract: Chat discourse convolution can include performing a lexicographic analysis of the content of a chat message of a chat discourse and storing a result of the lexicographic analysis in a database. The convolution can further include generating a hash of the content of the chat message and generating a leximarker. The leximarker can encapsulate a reference to the stored lexicographic analysis as well as the hash of the content of the chat message.

Abstract: In one embodiment, a processor of a cryptographic computing system includes data cache units storing encrypted data and circuitry coupled to the data cache units. The circuitry accesses a sequence of cryptographic-based instructions to execute based on the encrypted data, decrypts the encrypted data based on a first pointer value, executes the cryptographic-based instruction using the decrypted data, encrypts a result of the execution of the cryptographic-based instruction based on a second pointer value, and stores the encrypted result in the data cache units. In some embodiments, the circuitry generates, for each cryptographic-based instruction, at least one encryption-based microoperation and at least one non-encryption-based microoperation. The circuitry also schedules the at least one encryption-based microoperation and the at least one non-encryption-based microoperation for execution based on timings of the encryption-based microoperation.

Abstract: Systems and methods for selectively sharing of portion of unstructured data containers/documents based on security attributes or policies used to encrypt/decrypt data within the unstructured data containers using attribute-based encryption (ABE) are provided herein. In some embodiments, a system includes a key generation authority to generate encryption keys based on a selected cryptographic security scheme and one or more security attributes or security policies; an encryption service to selectively encrypt one or more data subgroups using the one or more public keys and based on one or more security attributes or security policies assigned to the one or more data subgroups with the unstructured data containers; and a decryption service to decrypt the one or more data subgroups within unstructured data containers using the one or more secret keys and the one or more public keys.

Abstract: A method for operating a beacon may include repeatedly emitting an identification number. The identification information is encrypted multiple times in a different manner by a one-way function and is emitted during the repeated emission in a differently encrypted form.

Abstract: Device, system, and method of generating and handling cryptographic parameters. A first device and a second device store the same secret seed value, utilize the same deterministic pseudo-random number generation function, and utilize the same deterministic value modification function. The first device generates a candidate value, sequentially modifies its value, and performs primality testing until a confirmed prime number is found. The first device indicates to the second device, how many iterations of value modifications to perform in order to reach and thus re-generate therein the same already-confirmed prime number, without the need to perform any primality testing in the second device.

Abstract: Disclosed are methods and systems to encrypt/decrypt a data message using Geometric Algebra and Hensel encoding (i.e., finite p-adic arithmetic). The security key(s), message data, and ciphertext are all represented as Geometric Algebra multivectors where a sum of the coefficients of an individual multivector is equal to the numeric value of the corresponding message or security key. Various Geometric Algebra operations with the message and security key multivectors act to encrypt/decrypt the message data. Each coefficient of the security key and message multivectors is further Hensel encoded to provide additional confusion/diffusion for the encrypted values. The Geometric Algebra operations permit homomorphic operations for adding, subtracting, multiplication and division of ciphertext multivectors such that the resulting ciphertext, when decrypted, is equal to corresponding mathematical operations using the unencrypted values.

Abstract: A method for secure multiparty computation of an inner product includes performing multiparty additions to generate a first sum share and a second sum share between two shares of alternating elements from corresponding pairs of elements in a first vector and a second vector, performing multiparty multiplications with at least one other node to generate inner product pair shares corresponding to products of the first sum shares and the second sum shares corresponding to pairs of elements in the first and second vectors, and performing another multiparty addition of each inner product pair share with a first negated shares of pair products corresponding to pairs of elements in the first vector and a second negated shares of pair products corresponding to pairs of elements in the second vector to generate a share of an inner product of the first and second vectors.

Abstract: Techniques for securing communication. The techniques include using at least one device to perform method for encrypting input data using a cipher associated with a plurality of languages including a first language, the first language associated with a first set of ciphertext symbols, a first permutation for the first set, and a first partition for the first permutation. The method includes obtaining, from the input data, a first plaintext symbol; mapping the first plaintext symbol to a first ciphertext symbol using the cipher, the mapping including: identifying a first set of candidate ciphertext symbols using the first plaintext symbol, the first permutation, and the first partition; and identifying, at random, the first ciphertext symbol from the first set of candidate ciphertext symbols; and outputting the first ciphertext symbol.

Abstract: A receiver in a communication system may include a buffer and hardware. The buffer may be configured to store a communication signal comprising one or more pulses representative of data. The hardware may be configured to determine whether a data authentication pulse has been superimposed over at least one of the one or more pulses, and authenticate, based on the determination of whether the data authentication pulse has been superimposed over at least one of the one or more pulses, the one or more pulses as a valid representation of the data.

Abstract: A Paillier decryption system, IC, and method. The IC includes: a modular exponentiation module, for performing modular exponentiation operations related to a first subitem and a second subitem, where a Paillier decryption process of encrypted data is divided into a first subitem and a second subitem according to the Chinese remainder theorem, the first subitem corresponding to a first prime, the second subitem corresponding to a second prime, a public key of the encrypted data being a product of the first prime and the second prime, a bit width of the first prime being the same as a bit width of the second prime; a first module combination corresponding to the first subitem, for determining a computation result of the first subitem; and a second module combination corresponding to the second subitem, for determining a computation result of the second subitem.

Abstract: Integrated circuits, methods, and computer programs are directed to performing proof-of-work (POW) operations. One integrated circuit includes a nonce register for storing a nonce value, a first one-way function (OWF) circuit configured to generate a hash of a header, a dynamic transform circuit configured to transform the hash of the header to generate a transform value, and a second OWF circuit configured to generate a hash of the transform value to obtain a validation parameter. The header includes the nonce value for POW validation of the header. Further, the transformation by the dynamic transform circuit is based on the nonce value. The validation parameter determines whether the POW meets a predetermined target for validation of the header with the nonce value.

Abstract: The present disclosure relates to a method for user administration of a field device of process automation technology, comprising the steps of connecting a transport medium, such as a smartphone, to a user database, synchronizing user data from the user database with the transport medium, and connecting the transport medium to the field device. The method also includes transmitting the user data from the transport medium to the field device, checking of the user data by the field device, and granting access to the field device on the basis of verified valid user data.

Abstract: A face authentication method includes receiving, from a first user terminal, a user account and a face image, obtaining a reference image corresponding to the user account, the reference image being prestored, and determining a second user terminal for helping the first user terminal complete face authentication of the face image with the reference image, the second user terminal being in a state of waiting to receive a first authentication code for the second user terminal to complete identity authentication of the first user terminal. The method further includes generating the first authentication code, sending, to the second user terminal, the first authentication code, the face image, and the reference image, and receiving, from the second user terminal, a result of the face authentication of the face image with the reference image, the result indicating whether the face authentication succeeds.

Abstract: Disclosed herein are system, method, and computer program product embodiments for encoding symbolic data into a subsymbolic format while preserving the semantic arrangement of the symbolic data. In an embodiment, to encode the symbolic data, a subsymbolic encoder system may convert a symbolic graph into a tuple representation having tuple elements corresponding to the nodes of the symbolic graph. The subsymbolic encoder system may retrieve a dictionary identification for each tuple element and calculate a subsymbolic value for each tuple element using an exponential component. The subsymbolic encoder system may standardize the length of the subsymbolic values and/or add a weighted relationship indicator to the subsymbolic values. The subsymbolic encoder system may transmit the subsymbolic values to a subsymbolic intelligence system.