Confidentiality of 2D Code using Infrared with Cell-level Error Correction

Optical information media printed on paper use printing materials to absorb visible light. There is a 2D code, which may be encrypted but also can possibly be copied. Hence, we envisage an information medium that cannot possibly be copied and thereby offers high security. At the surface, the normal 2D code is printed. The inner layers consist of 2D codes printed using a variety of materials, which absorb certain distinct wavelengths, to form a multilayered 2D code. Information can be distributed among the 2D codes forming the inner layers of the multiplex. Additionally, error correction at cell level can be introduce

Fault-tolerant scheduling with dynamic number of replicas in heterogeneous systems

In the existing studies on fault-tolerant scheduling, the active replication schema makes use of&nbsp;&epsilon; + 1 replicas for each task to tolerate&nbsp;&epsilon; failures. However, in this paper, we show that it does not always lead to a higher reliability with more replicas. Besides, the more replicas implies more resource consumption and higher economic cost. To address this problem, with the target to satisfy the user&rsquo;s reliability requirement with minimum resources, this paper proposes a new fault tolerant scheduling algorithm: MaxRe. In the algorithm, we incorporate the reliability analysis into the active replication schema and the theoretical analysis and experiments prove that the MaxRe algorithm&rsquo;s schedule can certainly satisfy user&rsquo;s reliability requirements. And the MaxRe scheduling algorithm can achieve the corresponding reliability with at most 70% fewer resources than the FTSA algorithm.</p

Computational Soundness of Uniformity Properties for Multi-party Computation based on LSSS

We provide a symbolic model for multi-party computation based on linear secret-sharing scheme, and prove that this model is com- putationally sound: if there is an attack in the computational world, then there is an attack in the symbolic (abstract) model. Our original contri- bution is that we deal with the uniformity properties, which cannot be described using a single execution trace, while considering an unbounded number of sessions of the protocols in the presence of active and adaptive adversaries

Detection of vanadyl-nitrogen interaction in organs of the vanadyl-treated rat: electron spin echo envelope modulation study

AbstractESEEM spectroscopy was applied for the first time to organs of an animal, viz. the kidney and liver of the rat treated with vanadyl sulfate. The aim of this study is to investigate the in vivo coordination structure of vanadyl ions administrated, and to gain information concerning the insulin-mimic activity of vanadium. ESEEM measurements for kidney and liver performed at 77 K have established nitrogen coordination to a certain percentage of vanadyl ion in the organs. The rotios of nitrogen-coordinating vanadyl ion were estimated as 70–80% in the liver, and 50–55% in the kidney. Isotropic portions of the 14N HFC were estimated as |Aiso| ∼ 5.0 MHz for liver, and ∼ 5.2 MHz for kidney, indicating that the coordinating nitrogen is an amino nitrogen. Coordination of the Lys ϵ-amine or the N-terminal α-amine of a protein or (a peptide) to vanadyl ion in vivo is suggested

Improved Proxy Re-encryption Scheme for Symmetric Key Cryptography

A proxy re-encryption scheme can be executed by a semi-trusted proxy, so that we can transform a ciphertext encrypted with a key to another ciphertext encrypted with different key without allowing the proxy to access the plaintext. A method to implement a secure proxy re-encryption is by first converting the plaintext to an intermediate form by using an all or nothing transform (AONT). In this paper, we describe an improved proxy re-encryption scheme for symmetric cipher by advocating the usage of a variant of the AONT function in the proxy re-encryption scheme. We show that the scheme secure under Chosen Plaintext Attack (CPA) for all possible types of attackers

Proofs of Knowledge on Monotone Predicates and its Application to Attribute-Based Identifications and Signatures

We propose a concrete procedure of the $\Sigma$-protocol introduced by Cramer, Damgård and Schoenmakers at CRYPTO \u2794, which is for proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable way; that is, hiding the assignment of truth in the predicate. We provide a detailed procedure by extending the so-called OR-proof

Characterizing NTRU-Variants Using Group Ring and Evaluating their Lattice Security

The encryption scheme NTRU is designed over a quotient ring of a polynomial ring. Basically, if the ring is changed to any other ring, NTRU-like cryptosystem is constructible. In this paper, we propose a variant of NTRU using group ring, which is called GR-NTRU. GR-NTRU includes NTRU as a special case. Moreover, we analyze and compare the security of GR-NTRU for several concrete groups. It is easy to investigate the algebraic structure of group ring by using group representation theory. We apply this fact to the security analysis of GR-NTRU. We show that the original NTRU and multivariate NTRU are most secure among several GR-NTRUs which we investigated