Jung Hee Cheon

According to our database1, Jung Hee Cheon authored at least 149 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Adventures in Crypto Dark Matter: Attacks, Fixes and Analysis for Weak Pseudorandom Function Candidates.
IACR Cryptol. ePrint Arch., 2020

HEAAN Demystified: Accelerating Fully Homomorphic Encryption Through Architecture-centric Analysis and Optimization.
CoRR, 2020

Advances in security research in the Asiacrypt region.
Commun. ACM, 2020

HE-Friendly Algorithm for Privacy-Preserving SVM Training.
IEEE Access, 2020

How to Securely Collaborate on Data: Decentralized Threshold HE and Secure Key Update.
IEEE Access, 2020

Hardware Architecture of a Number Theoretic Transform for a Bootstrappable RNS-based Homomorphic Encryption Scheme.
Proceedings of the 28th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2020

2019
Cryptanalysis of the CLT13 Multilinear Map.
J. Cryptol., 2019

Revisiting the Hybrid attack on sparse and ternary secret LWE.
IACR Cryptol. ePrint Arch., 2019

Privacy-preserving Approximate GWAS computation based on Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2019

Towards a Practical Clustering Analysis over Encrypted Data.
IACR Cryptol. ePrint Arch., 2019

Numerical Methods for Comparison on Homomorphically Encrypted Numbers.
IACR Cryptol. ePrint Arch., 2019

Efficient Homomorphic Comparison Methods with Optimal Complexity.
IACR Cryptol. ePrint Arch., 2019

A New Trapdoor over Module-NTRU Lattice and its Application to ID-based Encryption.
IACR Cryptol. ePrint Arch., 2019

Privacy-Preserving K-means Clustering with Multiple Data Owners.
IACR Cryptol. ePrint Arch., 2019

Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem.
IACR Cryptol. ePrint Arch., 2019

Verifiable Computing for Approximate Computation.
IACR Cryptol. ePrint Arch., 2019

Cryptoanalysis on 'A round-optimal lattice-based blind signature scheme for cloud services'.
Future Gener. Comput. Syst., 2019

RLizard: Post-Quantum Key Encapsulation Mechanism for IoT Devices.
IEEE Access, 2019

Improved Homomorphic Discrete Fourier Transforms and FHE Bootstrapping.
IEEE Access, 2019

A Hybrid of Dual and Meet-in-the-Middle Attack on Sparse and Ternary Secret LWE.
IEEE Access, 2019

Faster Linear Transformations in $\textsf{HElib}$ , Revisited.
IEEE Access, 2019

Towards a Practical Cluster Analysis over Encrypted Data.
Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019

FPGA-based Accelerators of Fully Pipelined Modular Multipliers for Homomorphic Encryption.
Proceedings of the 2019 International Conference on ReConFigurable Computing and FPGAs, 2019

Efficient Identity-Based Encryption from LWR.
Proceedings of the Information Security and Cryptology - ICISC 2019, 2019

Revisiting the Hybrid Attack on Sparse Secret LWE and Application to HE Parameters.
Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2019

Numerical Method for Comparison on Homomorphically Encrypted Numbers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Security-preserving Support Vector Machine with Fully Homomorphic Encryption.
Proceedings of the Workshop on Artificial Intelligence Safety 2019 co-located with the Thirty-Third AAAI Conference on Artificial Intelligence 2019 (AAAI-19), 2019

Logistic Regression on Homomorphic Encrypted Data at Scale.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Cryptographic Multilinear Maps and Their Cryptanalysis.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Instant Privacy-Preserving Biometric Authentication for Hamming Distance.
IACR Cryptol. ePrint Arch., 2018

Logistic Regression Model Training based on the Approximate Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2018

Efficient Logistic Regression on Large Encrypted Data.
IACR Cryptol. ePrint Arch., 2018

Multi-dimensional Packing for HEAAN for Approximate Matrix Arithmetics.
IACR Cryptol. ePrint Arch., 2018

A Reusable Fuzzy Extractor with Practical Storage Size.
IACR Cryptol. ePrint Arch., 2018

Polynomial Functional Encryption Scheme with Linear Ciphertext Size.
IACR Cryptol. ePrint Arch., 2018

Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from NTRU Attack.
IACR Cryptol. ePrint Arch., 2018

A Full RNS Variant of Approximate Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2018

Bootstrapping for Approximate Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2018

Faster Homomorphic Discrete Fourier Transforms and Improved FHE Bootstrapping.
IACR Cryptol. ePrint Arch., 2018

Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map.
IACR Cryptol. ePrint Arch., 2018

Ensemble Method for Privacy-Preserving Logistic Regression Based on Homomorphic Encryption.
IEEE Access, 2018

Cryptanalysis on the HHSS Obfuscation Arising From Absence of Safeguards.
IEEE Access, 2018

Toward a Secure Drone System: Flying With Real-Time Homomorphic Authenticated Encryption.
IEEE Access, 2018

Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Need for Controllers Having Integer Coefficients in Homomorphically Encrypted Dynamic System.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

A Reusable Fuzzy Extractor with Practical Storage Size: Modifying Canetti et al.'s Construction.
Proceedings of the Information Security and Privacy - 23rd Australasian Conference, 2018

2017
Secure Searching of Biomarkers Using Hybrid Homomorphic Encryption Scheme.
IACR Cryptol. ePrint Arch., 2017

Cryptanalysis of the Overstretched NTRU Problem for General Modulus Polynomial.
IACR Cryptol. ePrint Arch., 2017

Faster Bootstrapping of FHE over the Integers.
IACR Cryptol. ePrint Arch., 2017

Privacy-Preserving Computations of Predictive Medical Models with Minimax Approximation and Non-Adjacent Form.
Proceedings of the Financial Cryptography and Data Security, 2017

Homomorphic Encryption for Arithmetic of Approximate Numbers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Private Over-Threshold Aggregation Protocols over Distributed Datasets.
IEEE Trans. Knowl. Data Eng., 2016

Optimized Search-and-Compute Circuits and Their Application to Query Evaluation on Encrypted Data.
IEEE Trans. Inf. Forensics Secur., 2016

White-box AES implementation revisited.
J. Commun. Networks, 2016

The polynomial approximate common divisor problem and its application to the fully homomorphic encryption.
Inf. Sci., 2016

Fully Homomorphic Encryption over the Integers Revisited.
IACR Cryptol. ePrint Arch., 2016

Lizard: Cut off the Tail! // Practical Post-Quantum Public-Key Encryption from LWE and LWR.
IACR Cryptol. ePrint Arch., 2016

Floating-Point Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2016

Probability that the k-gcd of products of positive integers is B-smooth.
IACR Cryptol. ePrint Arch., 2016

An Algorithm for NTRU Problems and Cryptanalysis of the GGH Multilinear Map without an encoding of zero.
IACR Cryptol. ePrint Arch., 2016

A Practical Post-Quantum Public-Key Cryptosystem Based on spLWE.
IACR Cryptol. ePrint Arch., 2016

Cryptanalysis of the New CLT Multilinear Map over the Integers.
IACR Cryptol. ePrint Arch., 2016

Ghostshell: Secure Biometric Authentication using Integrity-based Homomorphic Evaluations.
IACR Cryptol. ePrint Arch., 2016

An Efficient Affine Equivalence Algorithm for Multiple S-Boxes and a Structured Affine Layer.
Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

A Practical Post-Quantum Public-Key Cryptosystem Based on \textsf spLWE.
Proceedings of the Information Security and Cryptology - ICISC 2016 - 19th International Conference, Seoul, South Korea, November 30, 2016

2015
A Hybrid Scheme of Public-Key Encryption and Somewhat Homomorphic Encryption.
IEEE Trans. Inf. Forensics Secur., 2015

Computing prime divisors in an interval.
Math. Comput., 2015

CRT-based fully homomorphic encryption over the integers.
Inf. Sci., 2015

Cryptanalysis of the New CLT Multilinear Maps.
IACR Cryptol. ePrint Arch., 2015

Cryptanalysis of the multilinear map on the ideal lattices.
IACR Cryptol. ePrint Arch., 2015

Homomorphic Computation of Edit Distance.
IACR Cryptol. ePrint Arch., 2015

Fixed argument pairing inversion on elliptic curves.
Des. Codes Cryptogr., 2015

Improved batch verification of signatures using generalized sparse exponents.
Comput. Stand. Interfaces, 2015

Static Analysis with Set-Closure in Secrecy.
Proceedings of the Static Analysis - 22nd International Symposium, 2015

Fully Homomophic Encryption over the Integers Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Accelerating bootstrapping in FHEW using GPUs.
Proceedings of the 26th IEEE International Conference on Application-specific Systems, 2015

2014
Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs.
Math. Comput., 2014

Search-and-compute on Encrypted Data.
IACR Cryptol. ePrint Arch., 2014

Cryptanalysis of the Multilinear Map over the Integers.
IACR Cryptol. ePrint Arch., 2014

Analytic Toolbox for White-Box Implementations: Limitation and Perspectives.
IACR Cryptol. ePrint Arch., 2014

A New Additive Homomorphic Encryption based on the co-ACD Problem.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
On the Final Exponentiation in Tate Pairing Computations.
IEEE Trans. Inf. Theory, 2013

Private Over-threshold Aggregation Protocols over Distributed Databases.
IACR Cryptol. ePrint Arch., 2013

An Approach to Reduce Storage for Homomorphic Computations.
IACR Cryptol. ePrint Arch., 2013

A Group Action on ℤ<sub>p</sub><sup>˟</sup> and the Generalized DLP with Auxiliary Inputs.
Proceedings of the Selected Areas in Cryptography - SAC 2013, 2013

Batch Fully Homomorphic Encryption over the Integers.
Proceedings of the Advances in Cryptology, 2013

2012
Accelerating Pollard's Rho Algorithm on Finite Fields.
J. Cryptol., 2012

Reducing RFID reader load with the meet-in-the-middle strategy.
J. Commun. Networks, 2012

Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures.
IACR Cryptol. ePrint Arch., 2012

Invertible Polynomial Representation for Private Set Operations.
IACR Cryptol. ePrint Arch., 2012

Private Top-k Aggregation Protocols.
IACR Cryptol. ePrint Arch., 2012

A Public Shuffle without Private Permutations.
IACR Cryptol. ePrint Arch., 2012

Compress Multiple Ciphertexts Using ElGamal Encryption Schemes.
IACR Cryptol. ePrint Arch., 2012

Accelerating the Final Exponentiation in the Computation of the Tate Pairings.
IACR Cryptol. ePrint Arch., 2012

A New Approach to Discrete Logarithm Problem with Auxiliary Inputs.
IACR Cryptol. ePrint Arch., 2012

Constant-Round Multi-party Private Set Union Using Reversed Laurent Series.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Private Over-Threshold Aggregation Protocols.
Proceedings of the Information Security and Cryptology - ICISC 2012, 2012

2011
Fast Exponentiation Using Split Exponents.
IEEE Trans. Inf. Theory, 2011

Fully Secure Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts.
IACR Cryptol. ePrint Arch., 2011

Analysis of Discrete Logarithm Algorithm using Pre-computation.
IACR Cryptol. ePrint Arch., 2011

Mutual Private Set Intersection with Linear Complexity.
IACR Cryptol. ePrint Arch., 2011

Constant-Round Privacy Preserving Multiset Union.
IACR Cryptol. ePrint Arch., 2011

Threshold signature schemes for ElGamal variants.
Comput. Stand. Interfaces, 2011

Correcting Errors in Private Keys Obtained from Cold Boot Attacks.
Proceedings of the Information Security and Cryptology - ICISC 2011 - 14th International Conference, Seoul, Korea, November 30, 2011

2010
Parameterized splitting systems for the discrete logarithm.
IEEE Trans. Inf. Theory, 2010

On Homomorphic Signatures for Network Coding.
IEEE Trans. Computers, 2010

Discrete Logarithm Problems with Auxiliary Inputs.
J. Cryptol., 2010

Metered signatures: How to restrict the signing capability.
J. Commun. Networks, 2010

2009
Subset-Restricted Random Walks for Pollard rho Method on F<sub>p<sup>m</sup></sub>.
Proceedings of the Public Key Cryptography, 2009

2008
Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption.
IEEE Trans. Inf. Theory, 2008

Provably Secure Timed-Release Public Key Encryption.
ACM Trans. Inf. Syst. Secur., 2008

Analysis of Low Hamming Weight Products.
Discret. Appl. Math., 2008

A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents.
Proceedings of the Public Key Cryptography, 2008

Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

Speeding Up the Pollard Rho Method on Prime Fields.
Proceedings of the Advances in Cryptology, 2008

2007
Fast Batch Verification of Multiple Signatures.
Proceedings of the Public Key Cryptography, 2007

2006
Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations.
IEEE Trans. Computers, 2006

Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme.
Inf. Process. Lett., 2006

Quadratic Equations from APN Power Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Analysis of Privacy-Preserving Element Reduction of Multiset.
IACR Cryptol. ePrint Arch., 2006

Privacy Protection in PKIs: A Separation-of-Authority Approach.
Proceedings of the Information Security Applications, 7th International Workshop, 2006

Security Analysis of the Strong Diffie-Hellman Problem.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

2005
Broadcast Encryption π.
IACR Cryptol. ePrint Arch., 2005

One-Way Chain Based Broadcast Encryption Schemes.
Proceedings of the Advances in Cryptology, 2005

New broadcast encryption scheme using tree-based circle.
Proceedings of the Fifth ACM Workshop on Digital Rights Management, 2005

2004
A New ID-based Signature with Batch Verification.
IACR Cryptol. ePrint Arch., 2004

Timed-Release and Key-Insulated Public Key Encryption.
IACR Cryptol. ePrint Arch., 2004

Taxonomy of online game security.
Electron. Libr., 2004

Batch Verifications with ID-Based Signatures.
Proceedings of the Information Security and Cryptology, 2004

Efficient Broadcast Encryption Using Multiple Interpolation Methods.
Proceedings of the Information Security and Cryptology, 2004

Resistance of S-Boxes against Algebraic Attacks.
Proceedings of the Fast Software Encryption, 11th International Workshop, 2004

2003
Nonlinearity of Boolean Functions and Hyperelliptic Curves.
SIAM J. Discret. Math., 2003

A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomophism.
IACR Cryptol. ePrint Arch., 2003

A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem.
IACR Cryptol. ePrint Arch., 2003

A Forward-Secure Blind Signature Scheme Based on the Strong RSA Assumption.
Proceedings of the Information and Communications Security, 5th International Conference, 2003

An Analysis of Proxy Signatures: Is a Secure Channel Necessary?
Proceedings of the Topics in Cryptology, 2003

2002
Diffie-Hellman Problems and Bilinear Maps.
IACR Cryptol. ePrint Arch., 2002

A Universal Forgery of Hess's Second ID-based Signature against the Known-message Attack.
IACR Cryptol. ePrint Arch., 2002

An Identity-Based Signature from Gap Diffie-Hellman Groups.
IACR Cryptol. ePrint Arch., 2002

Fast Elliptic Curve Point Counting Using Gaussian Normal Basis.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation).
Proceedings of the Cryptography and Coding, 2001

Improved Impossible Differential Cryptanalysis of Rijndael and Crypton.
Proceedings of the Information Security and Cryptology, 2001

Nonlinear Vector Resilient Functions.
Proceedings of the Advances in Cryptology, 2001

An Efficient Implementation of Braid Groups.
Proceedings of the Advances in Cryptology, 2001

2000
Elliptic Curves and Resilient Functions.
Proceedings of the Information Security and Cryptology, 2000

New Public-Key Cryptosystem Using Braid Groups.
Proceedings of the Advances in Cryptology, 2000

1999
S-boxes with Controllable Nonlinearity.
Proceedings of the Advances in Cryptology, 1999

1998
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map.
Proceedings of the Public Key Cryptography, 1998


  Loading...