Hyang-Sook Lee

Orcid: 0000-0001-9506-5760

According to our database1, Hyang-Sook Lee authored at least 43 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Practical Randomized Lattice Gadget Decomposition With Application to FHE.
IACR Cryptol. ePrint Arch., 2023

On Ideal Secret-Sharing Schemes for k-homogeneous access structures.
CoRR, 2023

2022
On Insecure Uses of BGN for Privacy Preserving Data Aggregation Protocols.
Fundam. Informaticae, 2022

On Privacy Preserving Data Aggregation Protocols using BGN cryptosystem.
CoRR, 2022

2021
Analysis on Yu et al.'s dynamic algorithm for canonic DBC.
Discret. Appl. Math., 2021

Efficient Lattice Gadget Decomposition Algorithm With Bounded Uniform Distribution.
IEEE Access, 2021

2020
Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS.
Int. J. Found. Comput. Sci., 2020

Algorithms for the Generalized NTRU Equations and their Storage Analysis.
Fundam. Informaticae, 2020

A refinement of Müller's cube root algorithm.
Finite Fields Their Appl., 2020

New orthogonality criterion for shortest vector of lattices and its applications.
Discret. Appl. Math., 2020

2019
On the Security of Multikey Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2019

Minimal condition for shortest vectors in lattices of low dimension.
Electron. Notes Discret. Math., 2019

2018
Key Substitution Attacks on Lattice Signature Schemes Based on SIS Problem.
Secur. Commun. Networks, 2018

On the Non-repudiation of Isogeny Based Signature Scheme.
Proceedings of the Information Security Theory and Practice, 2018

2017
Security Analysis of a Certificateless Signature from Lattices.
Secur. Commun. Networks, 2017

Forgeable quantum messages in arbitrated quantum signature schemes.
Quantum Inf. Process., 2017

Duplication free public keys based on SIS-type problems.
Finite Fields Their Appl., 2017

A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys.
Proceedings of the Information and Communications Security - 19th International Conference, 2017

On Pairing Inversion of the Self-bilinear Map on Unknown Order Groups.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

2016
An efficient lattice reduction using reuse technique blockwisely on NTRU.
Discret. Appl. Math., 2016

2015
Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves.
Finite Fields Their Appl., 2015

2014
An Efficient Decoding of Goppa Codes for the McEliece Cryptosystem.
Fundam. Informaticae, 2014

Polynomial generating pairing and its criterion for optimal pairing.
Appl. Algebra Eng. Commun. Comput., 2014

2013
Reducing Pairing Inversion to Exponentiation Inversion using Non-degenerate Auxiliary Pairing.
IACR Cryptol. ePrint Arch., 2013

Simple and exact formula for minimum loop length in Ate i pairing based on Brezing-Weng curves.
Des. Codes Cryptogr., 2013

Pairing Inversion via Non-degenerate Auxiliary Pairings.
Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

2011
An efficient incomparable public key encryption scheme.
Inf. Sci., 2011

Simple and Exact Formula for Minimum Loop Length in Ate<sub>i</sub> Pairing based on Brezing-Weng Curves.
IACR Cryptol. ePrint Arch., 2011

Optimal pairing computation over families of pairing-friendly elliptic curves.
Appl. Algebra Eng. Commun. Comput., 2011

2009
Efficient and Generalized Pairing Computation on Abelian Varieties.
IEEE Trans. Inf. Theory, 2009

Generating Pairing-Friendly Curves with the CM Equation of Degree 1.
Proceedings of the Pairing-Based Cryptography, 2009

2008
Eta pairing computation on general divisors over hyperelliptic curves y.
J. Symb. Comput., 2008

2007
Eta Pairing Computation on General Divisors over Hyperelliptic Curves y<sup>2</sup> = x<sup>7</sup>-x+/-1.
Proceedings of the Pairing-Based Cryptography, 2007

2006
Fast computation of Tate pairing on general divisors of genus 3 hyperelliptic curves.
IACR Cryptol. ePrint Arch., 2006

2005
A group key agreement protocol from pairings.
Appl. Math. Comput., 2005

2004
An Authenticated Certificateless Public Key Encryption Scheme.
IACR Cryptol. ePrint Arch., 2004

Multi-party authenticated key agreement protocols from multi-linear forms.
Appl. Math. Comput., 2004

A self-pairing map and its applications to cryptography.
Appl. Math. Comput., 2004

2003
An Authenticated Group Key Agreement Protocol on Braid groups.
IACR Cryptol. ePrint Arch., 2003

Tate-pairing implementations for tripartite key agreement.
IACR Cryptol. ePrint Arch., 2003

The better bound of private key in RSA with unbalanced primes.
Appl. Math. Comput., 2003

Tate Pairing Implementation for Hyperelliptic Curves y<sup>2</sup> = x<sup>p</sup>-x + d.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

2002
Multi-Party Authenticated Key Agreement Protocols from Multilinear Forms.
IACR Cryptol. ePrint Arch., 2002


  Loading...