Seung Geol Choi

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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. Cryptology, 2018

Efficient Range ORAM with 핆(log2N) Locality.
IACR Cryptology ePrint Archive, 2018

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

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

2017
ObliviSync: Practical Oblivious File Backup and Synchronization.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

Deterministic, Stash-Free Write-Only ORAM.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

2016
Improved, Black-Box, Non-Malleable Encryption from Semantic Security.
IACR Cryptology ePrint Archive, 2016

A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption.
IACR Cryptology ePrint Archive, 2016

A Practical Oblivious Map Data Structure with Secure Deletion and History Independence.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

POPE: Partial Order Preserving Encoding.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

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

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

2014
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

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

Efficient Three-Party Computation from Cut-and-Choose.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
Multi-Client Non-interactive Verifiable Computation.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

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

On the Security of the "Free-XOR" Technique.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 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

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

2011
On the Security of the Free-XOR Technique.
IACR Cryptology ePrint Archive, 2011

BiTR: Built-in Tamper Resilience.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

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 Cryptology ePrint Archive, 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

Fair Traceable Multi-Group Signatures.
Proceedings of the Financial Cryptography and Data Security, 12th International Conference, 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...