Seung Geol Choi

Orcid: 0000-0001-9563-9648

According to our database1, Seung Geol Choi authored at least 43 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the Privacy of Sublinear-Communication Jaccard Index Estimation via Min-hash Sketching.
IACR Cryptol. ePrint Arch., 2023

Semantically Rich Differential Access to Secure Cloud EHR.
Proceedings of the 9th Intl Conference on Big Data Security on Cloud, 2023

2022
Secure Sampling with Sublinear Communication.
IACR Cryptol. ePrint Arch., 2022

Semantically Rich Access Control in Cloud EHR Systems Based on MA-ABE.
Proceedings of the 8th IEEE Intl Conference on Big Data Security on Cloud, 2022

2021
Compressed Oblivious Encoding for Homomorphically Encrypted Search.
IACR Cryptol. ePrint Arch., 2021

Secure Cloud EHR with Semantic Access Control, Searchable Encryption and Attribute Revocation.
Proceedings of the IEEE International Conference on Digital Health, 2021

2020
Differentially-Private Multi-Party Sketching for Large-Scale Statistics.
Proc. Priv. Enhancing Technol., 2020

Cloud-based Encrypted EHR System with Semantically Rich Access Control and Searchable Encryption.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.
J. Cryptol., 2019

rORAM: Efficient Range ORAM with O(log2 N) Locality.
Proceedings of the 26th Annual Network and Distributed System Security Symposium, 2019

Multi Authority Access Control in a Cloud EHR System with MA-ABE.
Proceedings of the 3rd IEEE International Conference on Edge Computing, 2019

A Methodology for Retrofitting Privacy and Its Application to e-Shopping Transactions.
Proceedings of the Advances in Cyber Security: Principles, Techniques, and Applications., 2019

2018
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption.
J. Cryptol., 2018

Efficient Range ORAM with 핆(log<sup>2</sup>N) Locality.
IACR Cryptol. ePrint Arch., 2018

Improved, black-box, non-malleable encryption from semantic security.
Des. Codes Cryptogr., 2018

Privacy in e-Shopping Transactions: Exploring and Addressing the Trade-Offs.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2018

2017
Self-updatable encryption: Time constrained access control with hidden attributes and better efficiency.
Theor. Comput. Sci., 2017

Deterministic, Stash-Free Write-Only ORAM.
IACR Cryptol. ePrint Arch., 2017

2016
ObliviSync: Practical Oblivious File Backup and Synchronization.
IACR Cryptol. ePrint Arch., 2016

Managing Cloud Storage Obliviously.
Proceedings of the 9th IEEE International Conference on Cloud Computing, 2016

2015
POPE: Partial Order-Preserving Encoding.
IACR Cryptol. ePrint Arch., 2015

A Practical Oblivious Map Data Structure with Secure Deletion and History Independence.
IACR Cryptol. ePrint Arch., 2015

Multi-Client Non-Interactive Verifiable Computation.
IACR Cryptol. ePrint Arch., 2015

Oblivious Secure Deletion with Bounded History Independence.
CoRR, 2015

Privacy Threats in E-Shopping (Position Paper).
Proceedings of the Data Privacy Management, and Security Assurance, 2015

2014
Efficient Three-Party Computation from Cut-and-Choose.
IACR Cryptol. ePrint Arch., 2014

Blind Seer: A Scalable Private DBMS.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

2012
Lossy trapdoor functions from homomorphic reproducible encryption.
Inf. Process. Lett., 2012

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.
IACR Cryptol. ePrint Arch., 2012

On the Centrality of Off-Line E-Cash to Concrete Partial Information Games.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

2011
On the Security of the Free-XOR Technique.
IACR Cryptol. ePrint Arch., 2011

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces.
IACR Cryptol. ePrint Arch., 2011

2010
BiTR: Built-in Tamper Resilience.
IACR Cryptol. ePrint Arch., 2010

2009
The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure.
Inf. Process. Lett., 2009

Simple, Black-Box Constructions of Adaptively Secure Protocols.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Secure Multi-party Computation Minimizing Online Rounds.
Proceedings of the Advances in Cryptology, 2009

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols.
Proceedings of the Advances in Cryptology, 2009

2008
Fair Traceable Multi-Group Signatures.
IACR Cryptol. ePrint Arch., 2008

Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Reputation Systems for Anonymous Networks.
Proceedings of the Privacy Enhancing Technologies, 2008

2007
Anonymity 2.0 - X.509 Extensions Supporting Privacy-Friendly Authentication.
Proceedings of the Cryptology and Network Security, 6th International Conference, 2007

Two-Party Computing with Encrypted Data.
Proceedings of the Advances in Cryptology, 2007

2006
Short Traceable Signatures Based on Bilinear Pairings.
Proceedings of the Advances in Information and Computer Security, 2006


  Loading...