Claudio Orlandi

Orcid: 0000-0003-4992-0249

Affiliations:
  • Aarhus University, Department of Computer Science, Denmark


According to our database1, Claudio Orlandi authored at least 96 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
OneTwoPAKE: Two-Round Strong Asymmetric PAKE with Ideal Security.
IACR Cryptol. ePrint Arch., 2025

Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank.
IACR Cryptol. ePrint Arch., 2025

Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Securely Computing One-Sided Matching Markets.
IACR Cryptol. ePrint Arch., 2024

Distributed Differentially Private Data Analytics via Secure Sketching.
IACR Cryptol. ePrint Arch., 2024

Differentially Private Selection from Secure Distributed Computing.
Proceedings of the ACM on Web Conference 2024, 2024

Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

An Improved Threshold Homomorphic Cryptosystem Based on Class Groups.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

2023
Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model).
IACR Cryptol. ePrint Arch., 2023

Structure-Preserving Compilers from New Notions of Obfuscations.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Witness-Succinct Universally-Composable SNARKs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Secure Multiparty Computation from Threshold Encryption Based on Class Groups.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More.
Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

Improved Distributed RSA Key Generation Using the Miller-Rabin Test.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

On Access Control Encryption Without Sanitization.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

On the Bottleneck Complexity of MPC with Correlated Randomness.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model).
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

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Laconic Private Set-Intersection From Pairings.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing.
IACR Cryptol. ePrint Arch., 2021

Fiatâ€"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model).
IACR Cryptol. ePrint Arch., 2021

Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Two-Round n-out-of-n and Multi-signatures and Trapdoor Commitment from Lattices.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Stronger Notions and a More Efficient Construction of Threshold Ring Signatures.
Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021

Improved Threshold Signatures, Proactive Secret Sharing, and Input Certification from LSS Isomorphisms.
Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021

The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2021

Balancing Privacy and Accountability in Blockchain Identity Management.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

2020
Balancing Privacy and Accountability in Blockchain Transactions.
IACR Cryptol. ePrint Arch., 2020

LSS Homomorphisms and Applications to Secure Signatures, Proactive Secret Sharing and Input Certification.
IACR Cryptol. ePrint Arch., 2020

Stronger Security and Constructions of Multi-designated Verifier Signatures.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Secure Generalized Deduplication via Multi-Key Revealing Encryption.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Optimal Transport Layer for Secure Computation.
Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020

Security of Hedged Fiat-Shamir Signatures Under Fault Attacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Securing DNSSEC Keys via Threshold ECDSA from Generic MPC.
Proceedings of the Computer Security - ESORICS 2020, 2020

Black-Box Transformations from Passive to Covert Security with Public Verifiability.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing.
Proc. Priv. Enhancing Technol., 2019

Use your Brain! Arithmetic 3PC For Any Modulus with Active Security.
IACR Cryptol. ePrint Arch., 2019

Stronger Notions and Constructions for Multi-Designated Verifier Signatures.
IACR Cryptol. ePrint Arch., 2019

Optimizing Transport Layer for Secure Computation.
IACR Cryptol. ePrint Arch., 2019

Sharing Information with Competitors.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Transputation: Transport Framework for Secure Computation.
Proceedings of the 30. Krypto-Tag, Berlin, Germany, March 28-29, 2019, 2019

Commodity-Based 2PC for Arithmetic Circuits.
Proceedings of the Cryptography and Coding - 17th IMA International Conference, 2019

Proof-of-Stake Protocols for Privacy-Aware Blockchains.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Proofs of Replicated Storage Without Timing Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Quisquis: A New Design for Anonymous Cryptocurrencies.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Combining Private Set-Intersection with Secure Two-Party Computation.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security.
Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017
Security of Symmetric Primitives under Incorrect Usage of Keys.
IACR Cryptol. ePrint Arch., 2017

Assessing the No-Knowledge Property of SpiderOak ONE.
IACR Cryptol. ePrint Arch., 2017

Faster Zero-Knowledge Protocols and Applications - (Invited Talk Abstract).
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2017

Access Control Encryption for Equality, Comparison, and More.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Revealing Encryption for Partial Ordering.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

PrivatePool: Privacy-Preserving Ridesharing.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Cross&Clean: Amortized Garbled Circuits with Constant Overhead.
IACR Cryptol. ePrint Arch., 2016

Digital Signatures from Symmetric-Key Primitives.
IACR Cryptol. ePrint Arch., 2016

ZKBoo: Faster Zero-Knowledge for Boolean Circuits.
Proceedings of the 25th USENIX Security Symposium, 2016

Cross and Clean: Amortized Garbled Circuits with Constant Overhead.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Access Control Encryption: Enforcing Information Flow with Cryptography.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

How To Bootstrap Anonymous Communication.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

On the CCA (in)Security of MTProto.
Proceedings of the 6th Workshop on Security and Privacy in Smartphones and Mobile Devices, 2016

Non-Interactive Verifiable Secret Sharing for Monotone Circuits.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2016, 2016

2015
High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2015

The Simplest Protocol for Oblivious Transfer.
Proceedings of the Progress in Cryptology - LATINCRYPT 2015, 2015

Privacy-Enhancing Overlays in Bitcoin.
Proceedings of the Financial Cryptography and Data Security, 2015

Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
Statistical Concurrent Non-malleable Zero Knowledge.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Obfuscation ⇒ (IND-CPA Security !⇒ Circular Security).
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Publicly Auditable Secure Multi-Party Computation.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

A Framework for Outsourcing of Secure Computation.
Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, 2014

2013
On the Power of Correlated Randomness in Secure Computation.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions.
Proceedings of the Advances in Cryptology, 2013

Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Hiding the Input-Size in Secure Two-Party Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Privacy-aware mechanism design.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

A New Approach to Practical Active-Secure Two-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Calling Out Cheaters: Covert Security with Public Verifiability.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Is multiparty computation any good in practice?
Proceedings of the IEEE International Conference on Acoustics, 2011

Semi-homomorphic Encryption and Multiparty Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Lower and Upper Bounds for Deniable Public-Key Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
On the Necessary and Sufficient Assumptions for UC Computation.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost.
Proceedings of the Advances in Cryptology, 2010

On Invertible Sampling and Adaptive Security.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
LEGO for Two-Party Secure Computation.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2008
Enhancing Privacy in Remote Data Classification.
Proceedings of The IFIP TC-11 23rd International Information Security Conference, 2008

Essentially Optimal Universally Composable Oblivious Transfer.
Proceedings of the Information Security and Cryptology, 2008

2007
Oblivious Neural Network Computing via Homomorphic Encryption.
EURASIP J. Inf. Secur., 2007

2006
Zero-knowledge ST-DM watermarking.
Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents VIII, 2006

A privacy-preserving protocol for neural-network-based computation.
Proceedings of the 8th workshop on Multimedia & Security, 2006


  Loading...