Muthuramakrishnan Venkitasubramaniam

Oxana Poburinnaya

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021

Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles.

[BibT_eX]

[DOI]

SIGACT News, 2021

Round-Optimal Secure Multi-party Computation.

[BibT_eX]

[DOI]

Shai Halevi

J. Cryptol., 2021

2020

On the Power of Secure Two-Party Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2020

Going Beyond Dual Execution: MPC for Functions with Efficient Verification.

[BibT_eX]

[DOI]

Abhi Shelat

IACR Cryptol. ePrint Arch., 2020

LevioSA: Lightweight Secure Arithmetic Computation.

[BibT_eX]

[DOI]

Yuval Ishai

Antonio Marcedone

IACR Cryptol. ePrint Arch., 2020

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.

[BibT_eX]

[DOI]

Ruihan Wang

IACR Cryptol. ePrint Arch., 2020

Is it Easier to Prove Theorems that are Guaranteed to be True?

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Ligero++: A New Optimized Sublinear IOP.

[BibT_eX]

[DOI]

Rishabh Bhadauria

Zhiyong Fang

Mohammad Hossein Faghihi Sereshgi

Tiancheng Xie

Yupeng Zhang

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC.

[BibT_eX]

[DOI]

Jackson Abascal

Yuval Ishai

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

What Security Can We Achieve Within 4 Rounds?

[BibT_eX]

[DOI]

J. Cryptol., 2019

On Black-Box Complexity of Universally Composable Security in the CRS Model.

[BibT_eX]

[DOI]

J. Cryptol., 2019

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

2018

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation.

[BibT_eX]

[DOI]

CoRR, 2018

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions.

[BibT_eX]

[DOI]

Fabrice Benhamouda

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

2017

A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models.

[BibT_eX]

[DOI]

Susumu Kiyoshima

IACR Cryptol. ePrint Arch., 2017

Scalable Multi-Party Private Set-Intersection.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Better Two-Round Adaptive Multi-party Computation.

[BibT_eX]

[DOI]

Ran Canetti

Oxana Poburinnaya

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

2016

On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography.

[BibT_eX]

[DOI]

Douglas Miller

Adam Scrivener

Jesse Stern

IACR Cryptol. ePrint Arch., 2016

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity.

[BibT_eX]

[DOI]

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

2015

What Security can we Achieve in 4-Rounds?

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Round-Optimal Token-Based Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way.

[BibT_eX]

[DOI]

Alessandra Scafuro

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Secure Computation from Millionaire.

[BibT_eX]

[DOI]

Abhi Shelat

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Concurrent Zero Knowledge, Revisited.

[BibT_eX]

[DOI]

J. Cryptol., 2014

Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way.

[BibT_eX]

[DOI]

Alessandra Scafuro

IACR Cryptol. ePrint Arch., 2014

4-Round Resettably-Sound Zero Knowledge.

[BibT_eX]

[DOI]

Kai-Min Chung

Ivan Visconti

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

On Adaptively Secure Protocols.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms.

[BibT_eX]

[DOI]

Alex Page

Övünç Kocabas

Scott Ames

Tolga Soyata

Proceedings of the 2014 IEEE GLOBECOM Workshops, Austin, TX, USA, December 8-12, 2014, 2014

2013

Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Tal Malkin

Mariana Raykova

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2012

A Unified Framework for UC from Only OT.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions.

[BibT_eX]

[DOI]

Scott Ames

Rosario Gennaro

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Unified Framework for Concurrent Security.

[BibT_eX]

PhD thesis, 2011

Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Tal Malkin

Mariana Raykova

IACR Cryptol. ePrint Arch., 2011

Towards Non-Black-Box Lower Bounds in Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010

Private Coins versus Public Coins in Zero-Knowledge Proof Systems.

[BibT_eX]

[DOI]

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

Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.

[BibT_eX]

[DOI]

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

Concurrent Non-Malleable Zero Knowledge Proofs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

2009

A unified framework for concurrent security: universal composability from stand-alone non-malleability.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

On Constant-Round Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Concurrent Non-malleable Commitments from Any One-Way Function.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007

<i>L</i>-diversity: Privacy beyond <i>k</i>-anonymity.

[BibT_eX]

[DOI]

Ashwin Machanavajjhala

Daniel Kifer

Johannes Gehrke

ACM Trans. Knowl. Discov. Data, 2007

Precise Concurrent Zero Knowledge.

[BibT_eX]

[DOI]

Omkant Pandey

Amit Sahai

IACR Cryptol. ePrint Arch., 2007

An efficient parallel repetition theorem for Arthur-Merlin games.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Trusted CVS.

[BibT_eX]

[DOI]

Ashwin Machanavajjhala

David J. Martin

Johannes Gehrke

Proceedings of the 22nd International Conference on Data Engineering Workshops, 2006

l-Diversity: Privacy Beyond k-Anonymity.

[BibT_eX]

[DOI]

Ashwin Machanavajjhala

Johannes Gehrke

Daniel Kifer

Proceedings of the 22nd International Conference on Data Engineering, 2006

2004

On Byzantine Agreement over (2, 3)-Uniform Hypergraphs.

[BibT_eX]

[DOI]

D. V. S. Ravikant

V. Srikanth

K. Srinathan

C. Pandu Rangan

Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: on the round complexity of distributed consensus over synchronous networks.

[BibT_eX]

[DOI]

D. V. S. Ravikant