Alon Rosen

Prashant Nalini Vasudevan

Manuel Sabin

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Proofs of Useful Work.

[BibT_eX]

[DOI]

Marshall Ball

Prashant Nalini Vasudevan

Manuel Sabin

IACR Cryptol. ePrint Arch., 2017

Pseudorandom Functions: Three Decades Later.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Can PPAD Hardness be Based on Standard Cryptographic Assumptions?

[BibT_eX]

[DOI]

Ido Shahaf

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Functional Encryption for Bounded Collusions, Revisited.

[BibT_eX]

[DOI]

Shweta Agrawal

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Average-case fine-grained hardness.

[BibT_eX]

[DOI]

Marshall Ball

Prashant Nalini Vasudevan

Manuel Sabin

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Pseudorandom Functions: Three Decades Later.

[BibT_eX]

[DOI]

Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016

Online-Offline Functional Encryption for Bounded Collusions.

[BibT_eX]

[DOI]

Shweta Agrawal

IACR Cryptol. ePrint Arch., 2016

Indistinguishability Obfuscation Does Not Reduce to Structured Languages.

[BibT_eX]

[DOI]

Gilad Asharov

Electron. Colloquium Comput. Complex., 2016

Adaptive Security with Quasi-Optimal Rate.

[BibT_eX]

[DOI]

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

Rational Sumchecks.

[BibT_eX]

[DOI]

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

On the Hardness of Learning with Rounding over Small Modulus.

[BibT_eX]

[DOI]

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

2015

Non-committing Encryption from Φ-hiding.

[BibT_eX]

[DOI]

Brett Hemenway

Rafail Ostrovsky

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

The Power of Negations in Cryptography.

[BibT_eX]

[DOI]

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

Public Verification of Private Effort.

[BibT_eX]

[DOI]

Giulia Alberini

Tal Moran

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

On the Cryptographic Hardness of Finding a Nash Equilibrium.

[BibT_eX]

[DOI]

Nir Bitansky

Omer Paneth

François-Xavier Standaert

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Fast Non-Malleable Commitments.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014

Lower Bounds in the Hardware Token Model.

[BibT_eX]

[DOI]

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

On the existence of extractable one-way functions.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

Rational arguments: single round delegation with sublinear verification.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

Candidate weak pseudorandom functions in AC<sup>0</sup> ○ MOD<sub>2</sub>.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

SPRING: Fast Pseudorandom Functions from Rounded Ring Products.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption - 21st International Workshop, 2014

One-Way Functions and (Im)Perfect Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

An Algebraic Approach to Non-malleability.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

FPGA Implementations of SPRING - And Their Countermeasures against Side-Channel Attacks.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2014, 2014

2013

Public-Coin Parallel Zero-Knowledge for NP.

[BibT_eX]

[DOI]

Wei-Lung Dustin Tseng

J. Cryptol., 2013

There is no Indistinguishability Obfuscation in Pessiland.

[BibT_eX]

[DOI]

Tal Moran

IACR Cryptol. ePrint Arch., 2013

More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Limits on the Power of Cryptographic Cheap Talk.

[BibT_eX]

[DOI]

Pavel Hubácek

Jesper Buus Nielsen

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Lossy Functions Do Not Amplify Well.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

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

A Dichotomy for Local Small-Bias Generators.

[BibT_eX]

[DOI]

Benny Applebaum

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

A New Implementation of a Dual (Paper and Cryptographic) Voting System.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Electronic Voting 2012, 2012

Pseudorandom Functions and Lattices.

[BibT_eX]

[DOI]

Abhishek Banerjee

Chris Peikert

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011

Verifiable Elections and the Public (Dagstuhl Seminar 11281).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Input Locality and Hardness Amplification.

[BibT_eX]

[DOI]

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

2010

More Constructions of Lossy and Correlation-Secure Trapdoor Functions.

[BibT_eX]

[DOI]

David Mandell Freeman

Proceedings of the Public Key Cryptography, 2010

RIPPLE Authentication for Network Coding.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Sequential Rationality in Cryptographic Protocols.

[BibT_eX]

[DOI]

Ronen Gradwohl

Noam Livne

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Optimistic Concurrent Zero Knowledge.

[BibT_eX]

[DOI]

Abhi Shelat

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Chosen-Ciphertext Security via Correlated Products.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Fairness with an Honest Minority and a Rational Majority.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.

[BibT_eX]

[DOI]

Iftach Haitner

Ronen Shaltiel

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008

New and Improved Constructions of Nonmalleable Cryptographic Protocols.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Concurrent Nonmalleable Commitments.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

SWIFFT: A Modest Proposal for FFT Hashing.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

2007

Lattices that admit logarithmic worst-case to average-case connection factors.

[BibT_eX]

[DOI]

Chris Peikert

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

2006

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices.

[BibT_eX]

[DOI]

Chris Peikert

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Input-Indistinguishable Computation.

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich

[BibT_eX]

[DOI]

Information Security and Cryptography, Springer, ISBN: 978-3-540-32938-1, 2006

2005

New and improved constructions of non-malleable cryptographic protocols.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Concurrent Non-Malleable Commitments.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

On Robust Combiners for Oblivious Transfer and Other Primitives.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

A Note on Constant-Round Zero-Knowledge Proofs for NP.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Constant-Round Oblivious Transfer in the Bounded Storage Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Completeness in two-party secure computation: a computational view.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2003

Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

2002

Pseudorandom Functions and Factoring.

[BibT_eX]

[DOI]

Moni Naor

Omer Reingold

SIAM J. Comput., 2002

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Concurrent Zero Knowledge with Logarithmic Round-Complexity.

[BibT_eX]

[DOI]

Manoj Prabhakaran

Amit Sahai

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

Pseudo-Random Functions and Factoring

[BibT_eX]

[DOI]

Moni Naor

Omer Reingold

Electron. Colloquium Comput. Complex., 2001

Black-box concurrent zero-knowledge requires Omega~(log n) rounds.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

Pseudo-random functions and factoring (extended abstract).

[BibT_eX]

[DOI]

Moni Naor

Omer Reingold

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

A Note on the Round-Complexity of Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]