Claudio Orlandi

Orcid: 0000-0003-4992-0249

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


According to our database1, Claudio Orlandi authored at least 89 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Two-Round Stateless Deterministic Two-Party Schnorr Signatures From Pseudorandom Correlation Functions.
IACR Cryptol. ePrint Arch., 2023

MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More.
IACR Cryptol. ePrint Arch., 2023

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

Differentially Private Selection from Secure Distributed Computing.
IACR Cryptol. ePrint Arch., 2023

Improved Distributed RSA Key Generation Using the Miller-Rabin Test.
IACR Cryptol. ePrint Arch., 2023

2022
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices.
J. Cryptol., 2022

Witness-Succinct Universally-Composable SNARKs.
IACR Cryptol. ePrint Arch., 2022

Structure-Preserving Compilers from New Notions of Obfuscations.
IACR Cryptol. ePrint Arch., 2022

Secure Multiparty Computation from Threshold Encryption based on Class Groups.
IACR Cryptol. ePrint Arch., 2022

On Access Control Encryption without Sanitization.
IACR Cryptol. ePrint Arch., 2022

Laconic Private Set-Intersection From Pairings.
IACR Cryptol. ePrint Arch., 2022

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security.
IACR Cryptol. ePrint Arch., 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

2021
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer.
J. Cryptol., 2021

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

The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT.
IACR Cryptol. ePrint Arch., 2021

On the Bottleneck Complexity of MPC with Correlated Randomness.
IACR Cryptol. ePrint Arch., 2021

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

Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers.
IACR Cryptol. ePrint Arch., 2021

ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines.
IACR Cryptol. ePrint Arch., 2021

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.
IACR Cryptol. ePrint Arch., 2021

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

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

2020
Stronger Notions and a More Efficient Construction of Threshold Ring Signatures.
IACR Cryptol. ePrint Arch., 2020

Secure Generalized Deduplication via Multi-Key Revealing Encryption.
IACR Cryptol. ePrint Arch., 2020

Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2020

Black-Box Transformations from Passive to Covert Security with Public Verifiability.
IACR Cryptol. ePrint Arch., 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

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

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

Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices.
IACR Cryptol. ePrint Arch., 2019

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

Commodity-Based 2PC for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2019

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

Securing DNSSEC Keys via Threshold ECDSA From Generic MPC.
IACR Cryptol. ePrint Arch., 2019

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

Security of Hedged Fiat-Shamir Signatures under Fault Attacks.
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

2018
Proof-of-Stake Protocols for Privacy-Aware Blockchains.
IACR Cryptol. ePrint Arch., 2018

QuisQuis: A New Design for Anonymous Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2018

Proofs of Replicated Storage Without Timing Assumptions.
IACR Cryptol. ePrint Arch., 2018

Combining Private Set-Intersection with Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 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
Access Control Encryption for Equality, Comparison, and More.
IACR Cryptol. ePrint Arch., 2017

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

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings.
IACR Cryptol. ePrint Arch., 2017

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

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives.
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

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

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

A Framework for Outsourcing of Secure Computation.
IACR Cryptol. ePrint Arch., 2016

Revealing Encryption for Partial Ordering.
IACR Cryptol. ePrint Arch., 2016

ZKBoo: Faster Zero-Knowledge for Boolean Circuits.
IACR Cryptol. ePrint Arch., 2016

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

Access Control Encryption: Enforcing Information Flow with Cryptography.
IACR Cryptol. ePrint Arch., 2016

Non-Interactive Verifiable Secret Sharing For Monotone Circuits.
IACR Cryptol. ePrint Arch., 2016

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

2015
On the CCA (in)security of MTProto.
IACR Cryptol. ePrint Arch., 2015

How to Bootstrap Anonymous Communication.
IACR Cryptol. ePrint Arch., 2015

The Simplest Protocol for Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2015

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

2014
Statistical Concurrent Non-Malleable Zero Knowledge.
IACR Cryptol. ePrint Arch., 2014

Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2014

Publicly Auditable Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2014

2013
Obfuscation ==> (IND-CPA Security =/=> Circular Security).
IACR Cryptol. ePrint Arch., 2013

Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently.
IACR Cryptol. ePrint Arch., 2013

MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions.
IACR Cryptol. ePrint Arch., 2013

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

2012
Hiding the Input-Size in Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2012

Calling out Cheaters: Covert Security With Public Verifiability.
IACR Cryptol. ePrint Arch., 2012

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

2011
A New Approach to Practical Active-Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2011

Lower and Upper Bounds for Deniable Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2011

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

2010
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost.
IACR Cryptol. ePrint Arch., 2010

Semi-Homomorphic Encryption and Multiparty Computation.
IACR Cryptol. ePrint Arch., 2010

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

2009
On the Necessary and Sufficient Assumptions for UC Computation.
IACR Cryptol. ePrint Arch., 2009

2008
LEGO for Two Party Secure Computation.
IACR Cryptol. ePrint Arch., 2008

Essentially Optimal Universally Composable Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2008

Enhancing Privacy in Remote Data Classification.
Proceedings of The IFIP TC-11 23rd International Information Security Conference, 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...