Sunoo Park

Orcid: 0000-0002-1884-9585

According to our database1, Sunoo Park authored at least 28 papers between 2012 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The Superlinearity Problem in Post-Quantum Blockchains.
IACR Cryptol. ePrint Arch., 2022

Scan, Shuffle, Rescan: Machine-Assisted Election Audits With Untrusted Scanners.
IACR Cryptol. ePrint Arch., 2022

A Systematization of Voter Registration Security.
IACR Cryptol. ePrint Arch., 2022

Cryptography, Trust and Privacy: It's Complicated.
Proceedings of the 2022 Symposium on Computer Science and Law, 2022

2021
Going from bad to worse: from Internet voting to blockchain voting.
J. Cybersecur., 2021

KeyForge: Non-Attributable Email from Forward-Forgeable Signatures.
Proceedings of the 30th USENIX Security Symposium, 2021

2020
Data structures meet cryptography: 3SUM with preprocessing.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Fully Deniable Interactive Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
KeyForge: Mitigating Email Breaches with Forward-Forgeable Signatures.
IACR Cryptol. ePrint Arch., 2019

It wasn't me! Repudiability and Unclaimability of Ring Signatures.
IACR Cryptol. ePrint Arch., 2019

3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications.
CoRR, 2019

It Wasn't Me! - Repudiability and Claimability of Ring Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Cryptography for societal benefit.
PhD thesis, 2018

How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts.
IACR Cryptol. ePrint Arch., 2018

Public Accountability vs. Secret Laws: Can They Coexist?
IACR Cryptol. ePrint Arch., 2018

Practical Accountability of Secret Processes.
IACR Cryptol. ePrint Arch., 2018

Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling.
IACR Cryptol. ePrint Arch., 2018

Fully Bideniable Interactive Encryption.
IACR Cryptol. ePrint Arch., 2018

Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Proactive Secure Multiparty Computation with a Dishonest Majority.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017
Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal.
Proceedings of the 2017 on Workshop on Privacy in the Electronic Society, Dallas, TX, USA, October 30, 2017

2016
Towards Secure Quadratic Voting.
IACR Cryptol. ePrint Arch., 2016

2015
Spacemint: A Cryptocurrency Based on Proofs of Space.
IACR Cryptol. ePrint Arch., 2015

Adaptively Secure Coin-Flipping, Revisited.
IACR Cryptol. ePrint Arch., 2015

How to Incentivize Data-Driven Collaboration Among Competing Parties.
IACR Cryptol. ePrint Arch., 2015

2014
Towards Optimally Efficient Secret-Key Authentication from PRG.
IACR Cryptol. ePrint Arch., 2014

Cryptographically blinded games: leveraging players' limitations for equilibria and profit.
Proceedings of the ACM Conference on Economics and Computation, 2014

2012
Is Public-Key Encryption Based on LPN Practical?
IACR Cryptol. ePrint Arch., 2012


  Loading...