Jung Hee Cheon is a South Korean cryptographer and mathematician whose research interest includes computational number theory,cryptography,and information security. He is one of the inventors of braid cryptography,one of group-based cryptography,and approximate homomorphic encryption HEAAN. As one of co-inventors of approximate homomorphic encryption HEaaN,he is actively working on homomorphic encryptions and their applications including machine learning, [1] homomorphic control systems, [2] and DNA computation on encrypted data. [3] He is particularly known for his work on an efficient algorithm on strong DH problem. He received the best paper award in Asiacrypt 2008 for improving Pollard rho algorithm,and the best paper award in Eurocrypt 2015 for attacking Multilinear Maps. [4] [5] He was also selected as Scientist of the month by Korean government in 2018 [6] and won the POSCO TJ Park Prize in 2019. [7] [8]
He is a professor of Mathematical Sciences at the Seoul National University (SNU) and the director of IMDARC (the center for industrial math) in Seoul National University. He received Ph.D degrees in Mathematics from KAIST in 1997. Before joining SNU,he was in ETRI,Brown University,and ICU.
He was a program co-chair of ICISC 2008,MathCrypt 2013,ANTS-XI,Asiacrypt 2015,MathCrypt 2018/2019/2021,and PQC2021. [9] [10] [11] [12] [13] [14] [15] [16] He is one of two invited speakers in Asiacrypt 2020. [17] He also contributes academics as being an associate editor of Design,Codes and Cryptography,Journal of Communication Network,and Journal of Cryptology .
He was appointed a Fellow of IACR in 2023. [18]
The International Association for Cryptologic Research (IACR) is a non-profit scientific organization that furthers research in cryptology and related fields. The IACR was organized at the initiative of David Chaum at the CRYPTO '82 conference.
In cryptography,Camellia is a symmetric key block cipher with a block size of 128 bits and key sizes of 128,192 and 256 bits. It was jointly developed by Mitsubishi Electric and NTT of Japan. The cipher has been approved for use by the ISO/IEC,the European Union's NESSIE project and the Japanese CRYPTREC project. The cipher has security levels and processing abilities comparable to the Advanced Encryption Standard.
The MD4 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1990. The digest length is 128 bits. The algorithm has influenced later designs,such as the MD5,SHA-1 and RIPEMD algorithms. The initialism "MD" stands for "Message Digest".
Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields.
Serge Vaudenay is a French cryptographer and professor,director of the Communications Systems Section at the École Polytechnique Fédérale de Lausanne
Authenticated Encryption (AE) is an encryption scheme which simultaneously assures the data confidentiality and authenticity. Examples of encryption modes that provide AE are GCM,CCM.
Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. The resulting computations are left in an encrypted form which,when decrypted,result in an output that is identical to that of the operations performed on the unencrypted data. While homomorphic encryption does not protect against side-channel attacks that observe behavior,it can be used for privacy-preserving outsourced storage and computation. This allows data to be encrypted and outsourced to commercial cloud environments for processing,all while encrypted.
In cryptography,decorrelation theory is a system developed by Serge Vaudenay in 1998 for designing block ciphers to be provably secure against differential cryptanalysis,linear cryptanalysis,and even undiscovered cryptanalytic attacks meeting certain broad criteria. Ciphers designed using these principles include COCONUT98 and the AES candidate DFC,both of which have been shown to be vulnerable to some forms of cryptanalysis not covered by the theory.
In cryptography,PKCS #1 is the first of a family of standards called Public-Key Cryptography Standards (PKCS),published by RSA Laboratories. It provides the basic definitions of and recommendations for implementing the RSA algorithm for public-key cryptography. It defines the mathematical properties of public and private keys,primitive operations for encryption and signatures,secure cryptographic schemes,and related ASN.1 syntax representations.
Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices,either in the construction itself or in the security proof. Lattice-based constructions support important standards of post-quantum cryptography. Unlike more widely used and known public-key schemes such as the RSA,Diffie-Hellman or elliptic-curve cryptosystems —which could,theoretically,be defeated using Shor's algorithm on a quantum computer —some lattice-based constructions appear to be resistant to attack by both classical and quantum computers. Furthermore,many lattice-based constructions are considered to be secure under the assumption that certain well-studied computational lattice problems cannot be solved efficiently.
Nigel Smart is a professor at COSIC at the Katholieke Universiteit Leuven and Chief Academic Officer at Zama. He is a cryptographer with interests in the theory of cryptography and its application in practice.
Post-quantum cryptography (PQC),sometimes referred to as quantum-proof,quantum-safe,or quantum-resistant,is the development of cryptographic algorithms that are currently thought to be secure against a cryptanalytic attack by a quantum computer. Most widely-used public-key algorithms rely on the difficulty of one of three mathematical problems:the integer factorization problem,the discrete logarithm problem or the elliptic-curve discrete logarithm problem. All of these problems could be easily solved on a sufficiently powerful quantum computer running Shor's algorithm or even faster and less demanding alternatives.
Mordechai M. "Moti" Yung is a cryptographer and computer scientist known for his work on cryptovirology and kleptography.
Yehuda Lindell is an Israeli professor in the Department of Computer Science at Bar-Ilan University where he conducts research on cryptography with a focus on the theory of secure computation and its application in practice. Lindell currently leads the cryptography team at Coinbase.
Shai Halevi is a computer scientist who works on cryptography research at Amazon Web Services.
Dmitry Khovratovich is a Russian cryptographer,currently a Lead Cryptographer for the Dusk Network,researcher for the Ethereum Foundation,and member of the International Association for Cryptologic Research.
Ran Canetti is a professor of Computer Science at Boston University. and the director of the Check Point Institute for Information Security and of the Center for Reliable Information System and Cyber Security. He is also associate editor of the Journal of Cryptology and Information and Computation. His main areas of research span cryptography and information security,with an emphasis on the design,analysis and use of cryptographic protocols.
Simple Encrypted Arithmetic Library or SEAL is a free and open-source cross platform software library developed by Microsoft Research that implements various forms of homomorphic encryption.
OpenFHE is an open-source cross platform software library that provides implementations of fully homomorphic encryption schemes. OpenFHE is a successor of PALISADE and incorporates selected design features of HElib,HEAAN,and FHEW libraries.
PALISADE is an open-source cross platform software library that provides implementations of lattice cryptography building blocks and homomorphic encryption schemes.
International | |
---|---|
National | |
Academics |