Mark Simkin

Luisa Siniscalchi

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

Caulk: Lookup Arguments in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Squirrel: Efficient Synchronized Multi-Signatures from Lattices.

[BibT_eX]

[DOI]

Zhenfei Zhang

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Laconic Private Set-Intersection From Pairings.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Property-Preserving Hash Functions from Standard Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Optimal Oblivious Priority Queues.

[BibT_eX]

[DOI]

Zahra Jafargholi

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On Publicly-Accountable Zero-Knowledge and Small Shuffle Arguments.

[BibT_eX]

[DOI]

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

Robust Property-Preserving Hash Functions for Hamming Distance and More.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Lower Bounds for Multi-server Oblivious RAMs.

[BibT_eX]

[DOI]

Kevin Yeo

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security.

[BibT_eX]

[DOI]

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

Lower Bounds for Leakage-Resilient Secret Sharing.

[BibT_eX]

[DOI]

Jesper Buus Nielsen

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Black-Box Transformations from Passive to Covert Security with Public Verifiability.

[BibT_eX]

[DOI]

Ivan Damgård

Claudio Orlandi

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Exponential Lower Bounds for Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Optimal Oblivious Priority Queues and Offline Oblivious RAM.

[BibT_eX]

[DOI]

Zahra Jafargholi

IACR Cryptol. ePrint Arch., 2019

Use your Brain! Arithmetic 3PC For Any Modulus with Active Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

The Communication Complexity of Threshold Private Set Intersection.

[BibT_eX]

[DOI]

Satrajit Ghosh

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead.

[BibT_eX]

[DOI]

Michael A. Raskin

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018

Functional Credentials.

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., 2018

Oblivious RAM with Small Storage Overhead.

[BibT_eX]

[DOI]

Michael A. Raskin

IACR Cryptol. ePrint Arch., 2018

Compact Zero-Knowledge Proofs of Small Hamming Weight.

[BibT_eX]

[DOI]

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

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings.

[BibT_eX]

[DOI]

Ivan Damgård

Claudio Orlandi

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Continuously Non-malleable Codes with Split-State Refresh.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2018

2016

Nearly Optimal Verifiable Data Streaming.

[BibT_eX]

[DOI]

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

Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys.

[BibT_eX]

[DOI]

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

2015

Nearly Optimal Verifiable Data Streaming (Full Version).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

VeriStream - A Framework for Verifiable Data Streaming.

[BibT_eX]

[DOI]

Dominique Schröder

Proceedings of the Financial Cryptography and Data Security, 2015

2014

Ubic: Bridging the Gap between Digital Cryptography and the Physical World.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2014, 2014

POSTER: Enhancing Security and Privacy with Google Glass.

[BibT_eX]

[DOI]

Johannes Krupp

Dominique Schröder