Sungwook Kim

Orcid: 0000-0003-4789-3347

Affiliations:
  • Seoul Women's University, Division of Information Security, Korea
  • Samsung Research, Samsung Electronics, Security Lab, Software R&D Center, Seoul, Korea (2014-2020)
  • Seoul National University (SNU), Korea (PhD 2012)


According to our database1, Sungwook Kim authored at least 23 papers between 2008 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Fast Two-Party ECDSA With Online-Efficient Signing.
IEEE Access, 2026

2025
Optimization of 2-Party ECDSA Protocol.
IEEE Access, 2025

2023
Leopard: Sublinear Verifier Inner Product Argument Under Discrete Logarithm Assumption.
IEEE Trans. Inf. Forensics Secur., 2023

Efficient Transparent Polynomial Commitments for zk-SNARKs.
Proceedings of the Computer Security - ESORICS 2023, 2023

2022
Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Efficient Sum-Check Protocol for Convolution.
IEEE Access, 2021

Enhancing Differential Privacy for Federated Learning at Scale.
IEEE Access, 2021

2020
Learning New Words from Keystroke Data with Local Differential Privacy.
IEEE Trans. Knowl. Data Eng., 2020

2019
A new approach to practical function-private inner product encryption.
Theor. Comput. Sci., 2019

2018
Privacy Enhanced Matrix Factorization for Recommendation with Local Differential Privacy.
IEEE Trans. Knowl. Data Eng., 2018

Efficient Privacy-Preserving Matrix Factorization for Recommendation via Fully Homomorphic Encryption.
ACM Trans. Priv. Secur., 2018

A new scale-invariant homomorphic encryption scheme.
Inf. Sci., 2018

2017
A New Approach for Practical Function-Private Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2017

2016
Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2016

Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption: Extended Abstract.
Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, 2016

2015
Multilinear Map via Scale-Invariant FHE: Enhancing Security and Efficiency.
IACR Cryptol. ePrint Arch., 2015

Fast Order-Preserving Encryption from Uniform Distribution Sampling.
Proceedings of the 2015 ACM Workshop on Cloud Computing Security Workshop, 2015

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

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

Fixed Argument Pairing Inversion on Elliptic Curves.
IACR Cryptol. ePrint Arch., 2012

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

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

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


  Loading...