Kai-Min Chung

Han-Hsuan Lin

Proceedings of the 16th Conference on the Theory of Quantum Computation, 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds.

[BibT_eX]

[DOI]

Nai-Hui Chia

Takashi Yamakawa

IACR Cryptol. ePrint Arch., 2020

Classical Verification of Quantum Computations with Efficient Verifier.

[BibT_eX]

[DOI]

Nai-Hui Chia

Takashi Yamakawa

IACR Cryptol. ePrint Arch., 2020

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

On the Concurrent Composition of Quantum Zero-Knowledge.

[BibT_eX]

[DOI]

Prabhanjan Ananth

Rolando L. La Placa

IACR Cryptol. ePrint Arch., 2020

Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Tight Quantum Time-Space Tradeoffs for Function Inversion.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round.

[BibT_eX]

[DOI]

Nai-Hui Chia

Takashi Yamakawa

CoRR, 2020

On the Hardness of Massively Parallel Computation.

[BibT_eX]

[DOI]

Kuan-Yi Ho

Xiaorui Sun

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Lower Bounds for Function Inversion with Quantum Advice.

[BibT_eX]

[DOI]

Tai-Ning Liao

Luowen Qian

Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

When Simple Hash Functions Suffice.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019

Adaptively Secure Garbling Schemes for Parallel Computations.

[BibT_eX]

[DOI]

Luowen Qian

IACR Cryptol. ePrint Arch., 2019

On Quantum Advantage in Information Theoretic Single-Server PIR.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Quantum encryption and generalized Shannon impossibility.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

Cryptography with Disposable Backdoors.

[BibT_eX]

[DOI]

Cryptogr., 2019

Interactive Leakage Chain Rule for Quantum Min-entropy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Algorithmic Power of Spiking Neural Networks.

[BibT_eX]

[DOI]

Chi-Ning Chou

Chi-Jen Lu

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018

On statistically-secure quantum homomorphic encryption.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2018

Space-efficient classical and quantum algorithms for the shortest vector problem.

[BibT_eX]

[DOI]

Yanlin Chen

Quantum Inf. Comput., 2018

Cryptography with Dispensable Backdoors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Game Theoretic Notions of Fairness in Multi-Party Coin Toss.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

On the Complexity of Simulating Auxiliary Input.

[BibT_eX]

[DOI]

Yi-Hsiu Chen

Jyun-Jie Liao

IACR Cryptol. ePrint Arch., 2018

On the Sample Complexity of PAC Learning Quantum Process.

[BibT_eX]

[DOI]

Han-Hsuan Lin

CoRR, 2018

Generalized Quantum Shannon Impossibility for Quantum Encryption.

[BibT_eX]

[DOI]

CoRR, 2018

2017

On the Depth of Oblivious Parallel RAM.

[BibT_eX]

[DOI]

T.-H. Hubert Chan

Elaine Shi

IACR Cryptol. ePrint Arch., 2017

Distributed algorithms for the Lovász local lemma and graph coloring.

[BibT_eX]

[DOI]

Seth Pettie

Hsin-Hao Su

Distributed Comput., 2017

Computational Notions of Quantum Min-Entropy.

[BibT_eX]

[DOI]

CoRR, 2017

On the Impossibility of Cryptography with Tamperable Randomness.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Oblivious Parallel RAM and Applications.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Cryptography for Parallel RAM from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015

Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Functional Encryption from (Small) Hardwae Tokens.

[BibT_eX]

[DOI]

Jonathan Katz

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2015

Computation-Trace Indistinguishability Obfuscation and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Delegating RAM Computations with Adaptive Soundness and Privacy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Parallel Repetition for Entangled k-player Games via Fast Quantum Search.

[BibT_eX]

[DOI]

Xiaodi Wu

Henry S. Yuen

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

Huijia Lin

IACR Cryptol. ePrint Arch., 2014

Oblivious Parallel RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Large-Scale Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications.

[BibT_eX]

[DOI]

Xin Li

Xiaodi Wu

Electron. Colloquium Comput. Complex., 2014

4-Round Resettably-Sound Zero Knowledge.

[BibT_eX]

[DOI]

Rafail Ostrovsky

Muthuramakrishnan Venkitasubramaniam

Ivan Visconti

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Statistically-secure ORAM with Õ(log<sup>2</sup> n) Overhead.

[BibT_eX]

[DOI]

Zhenming Liu

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Theory Comput., 2013

Guest column: parallel repetition theorems for interactive arguments.

[BibT_eX]

[DOI]

SIGACT News, 2013

Interactive Coding, Revisited.

[BibT_eX]

[DOI]

Sidharth Telang

IACR Cryptol. ePrint Arch., 2013

Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security.

[BibT_eX]

[DOI]

Karn Seth

IACR Cryptol. ePrint Arch., 2013

A Simple ORAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Simultaneous Resettable WI from One-way Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

From Weak to Strong Zero-Knowledge and Applications.

[BibT_eX]

[DOI]

Edward Lui

IACR Cryptol. ePrint Arch., 2013

On Extractability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead.

[BibT_eX]

[DOI]

Zhenming Liu

CoRR, 2013

Randomness-Dependent Message Security.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Can theories be tested?: a cryptographic treatment of forecast testing.

[BibT_eX]

[DOI]

Edward Lui

Proceedings of the Innovations in Theoretical Computer Science, 2013

On the power of nonuniformity in proofs of security.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

Knowledge-Preserving Interactive Coding.

[BibT_eX]

[DOI]

Sidharth Telang

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Simultaneous Resettability from One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Constant-Round Concurrent Zero Knowledge from P-Certificates.

[BibT_eX]

[DOI]

Huijia Lin

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

On the Lattice Smoothing Parameter Problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Conference on Computational Complexity, 2013

Functional Encryption from (Small) Hardware Tokens.

[BibT_eX]

[DOI]

Jonathan Katz

Hong-Sheng Zhou

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions.

[BibT_eX]

[DOI]

Huijia Lin

IACR Cryptol. ePrint Arch., 2012

Unprovable Security of Two-Message Zero Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

The Knowledge Tightness of Parallel Zero-Knowledge.

[BibT_eX]

[DOI]

Wei-Lung Dustin Tseng

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

S-T connectivity on digraphs with a known stationary distribution.

[BibT_eX]

[DOI]

Omer Reingold

ACM Trans. Algorithms, 2011

Memory Delegation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

The Randomness Complexity of Parallel Repetition.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Efficient Secure Two-Party Exponentiation.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010

Improved Delegation of Computation using Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Yael Tauman Kalai

IACR Cryptol. ePrint Arch., 2010

Parallel Repetition Theorems for Interactive Arguments.

[BibT_eX]

[DOI]

Feng-Hao Liu

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

AMS Without 4-Wise Independence on Product Domains.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Efficient String-Commitment from Weak Bit-Commitment.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Tight Parallel Repetition Theorems for Public-coin Arguments.

[BibT_eX]

[DOI]

Feng-Hao Liu

Electron. Colloquium Comput. Complex., 2009

2008

Tight Bounds for Hashing Block Sources.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

2004

An Optimal Algorithm for the Maximum-Density Segment Problem.

[BibT_eX]

[DOI]

Hsueh-I Lu

SIAM J. Comput., 2004

Decomposition Methods for Linear Support Vector Machines.

[BibT_eX]

[DOI]

Neural Comput., 2004

2003

Radius Margin Bounds for Support Vector Machines with the RBF Kernel.

[BibT_eX]

[DOI]

Neural Comput., 2003

Decomposition methods for linear support vector machines.

[BibT_eX]

[DOI]

Proceedings of the 2003 IEEE International Conference on Acoustics, 2003

1998

Narrowband active noise control using adaptive delay filter.

[BibT_eX]

[DOI]

Sen M. Kuo