The Experts below are selected from a list of 6378 Experts worldwide ranked by ideXlab platform
Rongjian Chen - One of the best experts on this subject based on the ideXlab platform.
-
novel scan ca based image security system using scan and 2 d von neumann cellular automata
Signal Processing-image Communication, 2010Co-Authors: Rongjian Chen, Shijinn HorngAbstract:This paper presents a novel SCAN-CA-based image security system which belongs to synchronous stream cipher. Its Encryption method is based on permutation of the image pixels and replacement of the pixel values. Permutation is done by scan patterns generated by the SCAN approach. The pixel values are replaced using the recursive cellular automata (CA) substitution. The proposed image Encryption method satisfies the properties of confusion and diffusion as the characteristics of SCAN and CA substitution are flexible. The salient features of the proposed image Encryption method are lossless, symmetric Private Key Encryption, very large number of secret Keys, Key-dependent permutation, and Key-dependent pixel value replacement. Simulation results obtained using some color and gray-level images clearly demonstrate the strong performance of the proposed SCAN-CA-based image security system.
-
image security system using recursive cellular automata substitution
Pattern Recognition, 2007Co-Authors: Rongjian ChenAbstract:This paper presents a novel image security system based on the replacement of the pixel values using recursive cellular automata (CA) substitution. This proposed image Encryption method exhibits the properties of confusion and diffusion because of the characteristics of CA substitution are flexible. The salient features of the proposed image Encryption method are its losslessness, symmetric Private Key Encryption, very large number of secret Keys, and Key-dependent pixel value replacement. Simulation results obtained using some color and gray-level images clearly demonstrate the strong performance of the proposed image security system.
Shijinn Horng - One of the best experts on this subject based on the ideXlab platform.
-
novel scan ca based image security system using scan and 2 d von neumann cellular automata
Signal Processing-image Communication, 2010Co-Authors: Rongjian Chen, Shijinn HorngAbstract:This paper presents a novel SCAN-CA-based image security system which belongs to synchronous stream cipher. Its Encryption method is based on permutation of the image pixels and replacement of the pixel values. Permutation is done by scan patterns generated by the SCAN approach. The pixel values are replaced using the recursive cellular automata (CA) substitution. The proposed image Encryption method satisfies the properties of confusion and diffusion as the characteristics of SCAN and CA substitution are flexible. The salient features of the proposed image Encryption method are lossless, symmetric Private Key Encryption, very large number of secret Keys, Key-dependent permutation, and Key-dependent pixel value replacement. Simulation results obtained using some color and gray-level images clearly demonstrate the strong performance of the proposed SCAN-CA-based image security system.
Venkatesh Srinivasan - One of the best experts on this subject based on the ideXlab platform.
-
on generic constructions of circularly secure leakage resilient public Key Encryption schemes
Public Key Cryptography, 2016Co-Authors: Mohammad Hajiabadi, Bruce M. Kapron, Venkatesh SrinivasanAbstract:We propose generic constructions of public-Key Encryption schemes, satisfying Key-dependent message KDM security for projections and different forms of Key-leakage resilience, from CPA-secure Private-Key Encryption schemes with two main abstract properties: 1 a form of additive homomorphism with respect to both plaintexts and randomness, and 2 reproducibility, providing a means for reusing Encryption randomness across independent secret Keys. More precisely, our construction transforms a Private-Key scheme with the stated properties and one more mild condition into a public-Key one, providing: KDM-projection security, an extension of circular security, where the adversary may also ask for Encryptions of negated secret Key bits;a $$1-o1$$ resilience rate in the bounded-memory leakage model of Akavia et al. TCC 2009; andAuxiliary-input security against subexponentially-hard functions. We introduce homomorphic weak pseudorandom functions, a homomorphic version of the weak PRFs proposed by Naor and Reingold FOCS '95 and use them to realize our base Encryption scheme. We in turn obtain homomorphic weak PRFs from homomorphic hash-proof systemsHHPS. We also show how the base Encryption scheme may be realized using subgroup indistinguishability implied, in particular, by quadratic residuosity QR and decisional composite residuosity DCR. As corollaries of our results, we obtain 1 the first multiple-Key projection-secure bit-Encryption scheme as well as the first scheme with a $$1-o1$$ resilience rate based solely on the HHPS assumption, and 2 a unifying approach explaining the results of Boneh et al. CRYPTO '08 and Brakerski and Goldwasser CRYPTO '10. Finally, by observing that Applebaum's KDM amplification method EUROCRYPT '11 preserves both types of leakage resilience, we obtain schemes providing at the same time high leakage resilience and KDM security against any fixed polynomial-sized circuit family.
-
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes
2016Co-Authors: Mohammad Hajiabadi, Bruce M. Kapron, Venkatesh SrinivasanAbstract:Abstract. We propose generic constructions of public-Key Encryption schemes, satisfying Key-dependent message (KDM) security for projections and different forms of Key-leakage resilience, from CPA-secure Private Key Encryption schemes with two main abstract properties: (1) additive homomorphism with respect to both messages and randomness, and (2) reproducibility, providing a means for reusing Encryption randomness across independent secret Keys. More precisely, our con-struction transforms a Private-Key scheme with the stated properties (and one more mild condition) into a public-Key one, providing: – n-KDM-projection security, an extension of circular security, where the adversary may also ask for Encryptions of negated secret Key bits; – a (1 − o(1)) resilience rate in the bounded-memory leakage model of Akavia et al. (TCC 2009); and – Auxiliary-input security against subexponentially-hard functions. We introduce homomorphic weak pseudorandom functions, a homomorphic version of the weak PRFs proposed by Naor and Reingold (FOCS ’95) and use them to realize our base Encryption scheme. We obtain homomorphic weak PRFs under assumptions including subgroup indistinguisha-bility (implied, in particular, by QR and DCR) and homomorphic hash-proof systems (HHPS). As corollaries of our results, we obtain (1) a projection-secure Encryption scheme (as well as a scheme with a (1−o(1)) resilience rate) based solely on the HHPS assumption, and (2) a unifying approach explaining the results of Boneh et al (CRYPTO ’08) and Brakerski and Goldwasser (CRYPTO ’10). Finally, by observing that Applebaum’s KDM amplification method (EUROCRYPT ’11) preserves both types of leakage resilience, we obtain schemes providing at the same time high leakage re-silience and KDM security against any fixed polynomial-sized circuit family.
Reinhardt Isabel - One of the best experts on this subject based on the ideXlab platform.
-
Incorporation of Multiple Sources into IT – and Data Protection Concepts: Lessons Learned from the FARKOR Project
'IOS Press', 2020Co-Authors: Lindörfer Doris, Mansmann Ulrich, Reinhardt IsabelAbstract:The IT- and data protection concept of the FAmiliäres Risiko für das KOloRektale Karzinom (FARKOR) project will be presented. FARKOR is a risk adapted screening-project in Bavaria, Germany focusing on young adults with familial colorectal cancer (CRC). For each participant, data from different sources have to be integrated: Treatment records centrally administered by the resident doctors association (KVB), data from health insurance companies (HIC), and patient reported lifestyle data. Patient privacy rights must be observed. Record Linkage is performed by a central independent trust center. Data are decrypted, integrated and analyzed in a secure part of the scientific evaluation center with no connection to the internet (SECSP). The presented concept guarantees participants privacy through different identifiers, separation of responsibilities, data pseudonymization, public-Private Key Encryption of medical data and encrypted data transfer
-
Incorporation of Multiple Sources into IT - and Data Protection Concepts: Lessons Learned from the FARKOR Project
'IOS Press', 2020Co-Authors: Lindoerfer Doris, Mansmann Ulrich, Reinhardt IsabelAbstract:The IT- and data protection concept of the FAmiliäres Risiko für das KOloRektale Karzinom (FARKOR) project will be presented. FARKOR is a risk adapted screening-project in Bavaria, Germany focusing on young adults with familial colorectal cancer (CRC). For each participant, data from different sources have to be integrated: Treatment records centrally administered by the resident doctors association (KVB), data from health insurance companies (HIC), and patient reported lifestyle data. Patient privacy rights must be observed. Record Linkage is performed by a central independent trust center. Data are decrypted, integrated and analyzed in a secure part of the scientific evaluation center with no connection to the internet (SECSP). The presented concept guarantees participants privacy through different identifiers, separation of responsibilities, data pseudonymization, public-Private Key Encryption of medical data and encrypted data transfer
Yuval Ishai - One of the best experts on this subject based on the ideXlab platform.
-
basing weak public Key cryptography on strong one way functions
Theory of Cryptography Conference, 2008Co-Authors: Eli Biham, Yaron J Goren, Yuval IshaiAbstract:In one of the pioneering papers on public-Key cryptography, Ralph Merkle suggested a heuristic protocol for exchanging a secret Key over an insecure channel by using an idealized Private-Key Encryption scheme. Merkle's protocol is presumed to remain secure as long as the gap between the running time of the adversary and that of the honest parties is at most quadratic (rather than super-polynomial). In this work, we initiate an effort to base similar forms of public-Key cryptography on well-founded assumptions. We suggest a variant of Merkle's protocol whose security can be based on the one-wayness of the underlying primitive. Specifically, using a one-way function of exponential strength, we obtain a Key agreement protocol resisting adversaries whose running time is nearly quadratic in the running time of the honest parties. This protocol gives the adversary a small (but non-negligible) advantage in guessing the Key. We show that the security of the protocol can be amplified by using a one-way function with a strong form of a hard-core predicate, whose existence follows from a conjectured "dream version" of Yao's XOR lemma. On the other hand, we show that this type of hard-core predicate cannot be based on (even exponentially strong) one-wayness by using a black-box construction. In establishing the above results, we reveal interesting connections between the problem under consideration and problems from other domains. In particular, we suggest a paradigm for converting (unconditionally) secure protocols in Maurer's bounded storage model into (computationally) secure protocols in the random oracle model, translating storage advantage into computational advantage. Our main protocol can be viewed as an instance of this paradigm. Finally, we observe that a quantum adversary can completely break the security of our protocol (as well as Merkle's heuristic protocol) by using the quadratic speedup of Grover's quantum search algorithm. This raises a speculation that there might be a closer relation between (classical) public-Key cryptography and quantum computing than is commonly believed.