Claudio Orlandi

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An improved threshold homomorphic cryptosystem based on class groups2025-01-10Paper
Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
Journal of Cryptology
2024-12-27Paper
MPC with low bottleneck-complexity: information-theoretic security and more2024-11-22Paper
Secure multiparty computation from threshold encryption based on class groups
Advances in Cryptology – CRYPTO 2023
2024-02-02Paper
Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
Advances in Cryptology – CRYPTO 2023
2024-02-02Paper
Witness-succinct universally-composable SNARKs
Advances in Cryptology – EUROCRYPT 2023
2023-12-08Paper
Structure-preserving compilers from new notions of obfuscations
Lecture Notes in Computer Science
2023-11-16Paper
scientific article; zbMATH DE number 7759457 (Why is no real title available?)2023-11-02Paper
Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
Lecture Notes in Computer Science
2023-07-25Paper
On access control encryption without sanitization
Lecture Notes in Computer Science
2023-07-25Paper
An algebraic framework for silent preprocessing with trustless setup and active security
Advances in Cryptology – CRYPTO 2022
2023-07-07Paper
Black-box transformations from passive to covert security with public verifiability2022-11-09Paper
Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)2022-08-30Paper
On the bottleneck complexity of MPC with correlated randomness
Public-Key Cryptography – PKC 2022
2022-07-08Paper
\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Public-Key Cryptography – PKC 2022
2022-07-08Paper
Stronger notions and a more efficient construction of threshold ring signatures2022-06-15Paper
Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms2022-06-15Paper
Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
Journal of Cryptology
2022-04-21Paper
Stronger security and constructions of multi-designated verifier signatures2022-03-23Paper
Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
Public-Key Cryptography – PKC 2021
2021-12-21Paper
Balancing privacy and accountability in blockchain identity management2021-12-20Paper
The rise of Paillier: homomorphic secret sharing and public-key silent OT2021-12-08Paper
Security of hedged Fiat-Shamir signatures under fault attacks2021-12-01Paper
High-performance multi-party computation for binary circuits based on oblivious transfer
Journal of Cryptology
2021-08-10Paper
Quisquis: a new design for anonymous cryptocurrencies2020-05-20Paper
Proofs of replicated storage without timing assumptions2020-05-20Paper
Sharing information with competitors
(available as arXiv preprint)
2020-02-04Paper
Sharing information with competitors2020-02-04Paper
Combining private set intersection with secure two-party computation2018-10-17Paper
Yet another compiler for active security or: efficient MPC over arbitrary rings2018-09-26Paper
Revealing encryption for partial ordering2018-04-20Paper
Access Control Encryption for Equality, Comparison, and More
Lecture Notes in Computer Science
2017-06-13Paper
Access control encryption: enforcing information flow with cryptography
Theory of Cryptography
2016-12-22Paper
Cross and clean: amortized garbled circuits with constant overhead
Theory of Cryptography
2016-12-21Paper
Non-interactive verifiable secret sharing for monotone circuits
Progress in Cryptology – AFRICACRYPT 2016
2016-06-22Paper
How to bootstrap anonymous communication
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
2016-04-15Paper
Privacy-free garbled circuits with applications to efficient zero-knowledge
Advances in Cryptology - EUROCRYPT 2015
2015-09-30Paper
The simplest protocol for oblivious transfer
Progress in Cryptology -- LATINCRYPT 2015
2015-09-17Paper
Obfuscation \(\Rightarrow\) (IND-CPA security \(\nRightarrow\) circular security)
Lecture Notes in Computer Science
2014-10-14Paper
Publicly auditable secure multi-party computation
Lecture Notes in Computer Science
2014-10-14Paper
Statistical concurrent non-malleable zero knowledge
Theory of Cryptography
2014-02-18Paper
Hiding the input-size in secure two-party computation
Advances in Cryptology - ASIACRYPT 2013
2013-12-10Paper
MiniLEGO: efficient secure two-party computation from general assumptions
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings
2013-05-31Paper
Calling out cheaters: covert security with public verifiability
Advances in Cryptology – ASIACRYPT 2012
2013-03-19Paper
On the power of correlated randomness in secure computation
Theory of Cryptography
2013-03-18Paper
A new approach to practical active-secure two-party computation
Lecture Notes in Computer Science
2012-09-25Paper
Lower and upper bounds for deniable public-key encryption
Lecture Notes in Computer Science
2011-12-02Paper
Semi-homomorphic encryption and multiparty computation
Advances in Cryptology – EUROCRYPT 2011
2011-05-27Paper
On Invertible Sampling and Adaptive Security
Advances in Cryptology - ASIACRYPT 2010
2010-12-07Paper
Multiparty computation for dishonest majority: from passive to active security at low cost
Advances in Cryptology – CRYPTO 2010
2010-08-24Paper
On the necessary and sufficient assumptions for UC computation
Theory of Cryptography
2010-02-24Paper
LEGO for Two-Party Secure Computation
Theory of Cryptography
2009-03-03Paper


Research outcomes over time


This page was built for person: Claudio Orlandi