Dario Catalano

Orcid: 0000-0001-9677-944X

According to our database1, Dario Catalano authored at least 78 papers between 1996 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security.
Theor. Comput. Sci., 2023

Chainable Functional Commitments for Unbounded-Depth Circuits.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures.
IACR Cryptol. ePrint Arch., 2022

On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups.
IACR Cryptol. ePrint Arch., 2022

Adaptively Secure Single Secret Leader Election from DDH.
IACR Cryptol. ePrint Arch., 2022

Functional Commitments for Circuits from Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2022

2021
Efficient and Universally Composable Single Secret Leader Election from Pairings.
IACR Cryptol. ePrint Arch., 2021

Bandwidth-efficient threshold EC-DSA revisited: Online/Offline Extensions, Identifiable Aborts, Proactivity and Adaptive Security.
IACR Cryptol. ePrint Arch., 2021

2020
Double-Authentication-Preventing Signatures in the Standard Model.
IACR Cryptol. ePrint Arch., 2020

Bandwidth-efficient threshold EC-DSA.
IACR Cryptol. ePrint Arch., 2020

Inner-Product Functional Encryption with Fine-Grained Access Control.
IACR Cryptol. ePrint Arch., 2020

Mon$\mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $\mathbb {Z}_{2^{k}}$.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

2019
Monℤ<sub>2<sup>k</sup></sub>a: Fast Maliciously Secure Two Party Computation on ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2019

Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations.
IACR Cryptol. ePrint Arch., 2019

Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality.
Proceedings of the Topics in Cryptology - CT-RSA 2019, 2019

2018
Practical Homomorphic Message Authenticators for Arithmetic Circuits.
J. Cryptol., 2018

Verifiable pattern matching on outsourced texts.
J. Discrete Algorithms, 2018

Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions.
Des. Codes Cryptogr., 2018

2017
A certificateless approach to onion routing.
Int. J. Inf. Sec., 2017

Labeled Homomorphic Encryption: Scalable and Privacy-Preserving Processing of Outsourced Data.
IACR Cryptol. ePrint Arch., 2017

Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption.
IACR Cryptol. ePrint Arch., 2017

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings.
IACR Cryptol. ePrint Arch., 2017

2016
Editor's Note.
IEEE Trans. Dependable Secur. Comput., 2016

On the Security Notions for Homomorphic Signatures.
IACR Cryptol. ePrint Arch., 2016

Practical Functional Encryption for Bilinear Forms.
IACR Cryptol. ePrint Arch., 2016

2015
Algebraic (trapdoor) one-way functions: Constructions and applications.
Theor. Comput. Sci., 2015

Programmable Hash Functions go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys.
IACR Cryptol. ePrint Arch., 2015

Generalizing Homomorphic MACs for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2015

Practical Homomorphic MACs for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2015

Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions.
J. Cryptol., 2014

Homomorphic Signatures with Efficient Verification for Polynomial Functions.
IACR Cryptol. ePrint Arch., 2014

Boosting Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data.
IACR Cryptol. ePrint Arch., 2014

Homomorphic Signatures and Message Authentication Codes.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Authenticating Computation on Groups: New Homomorphic Primitives and Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Fully non-interactive onion routing with forward secrecy.
Int. J. Inf. Sec., 2013

Off-line/on-line signatures revisited: a general unifying paradigm, efficient threshold variants and experimental results.
Int. J. Inf. Sec., 2013

Linearly Homomorphic Structure Preserving Signatures: New Methodologies and Applications.
IACR Cryptol. ePrint Arch., 2013

Algebraic (Trapdoor) One-Way Functions and Their Applications.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Vector Commitments and Their Applications.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

2011
Zero-Knowledge Sets With Short Proofs.
IEEE Trans. Inf. Theory, 2011

Wildcarded Identity-Based Encryption.
J. Cryptol., 2011

Efficient Network Coding Signatures in the Standard Model.
IACR Cryptol. ePrint Arch., 2011

Adaptive Pseudo-Free Groups and Applications.
IACR Cryptol. ePrint Arch., 2011

Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases.
IACR Cryptol. ePrint Arch., 2011

2010
Privacy-preserving fingercode authentication.
Proceedings of the Multimedia and Security Workshop, 2010

A privacy-compliant fingerprint recognition system based on homomorphic encryption and Fingercode templates.
Proceedings of the Fourth IEEE International Conference on Biometrics: Theory Applications and Systems, 2010

2009
Verifiable Random Functions from Identity-Based Key Encapsulation.
Proceedings of the Advances in Cryptology, 2009

Certificateless onion routing.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness.
Proceedings of the Progress in Cryptology, 2009

2008
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions.
J. Cryptol., 2008

Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results.
Proceedings of the Public Key Cryptography, 2008

Zero-Knowledge Sets with Short Proofs.
Proceedings of the Advances in Cryptology, 2008

Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework.
Proceedings of the Topics in Cryptology, 2008

2007
Hybrid commitments and their applications to zero-knowledge proof systems.
Theor. Comput. Sci., 2007

Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring.
Theor. Comput. Sci., 2007

Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication.
J. Cryptol., 2007

Improved On-Line/Off-Line Threshold Signatures.
Proceedings of the Public Key Cryptography, 2007

2006
Identity-Based Encryption Gone Wild.
IACR Cryptol. ePrint Arch., 2006

Mercurial Commitments: Minimal Assumptions and Efficient Constructions.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

2005
A P2P Market Place Based on Aggregate Signatures.
Proceedings of the Parallel and Distributed Processing and Applications, 2005

Hybrid Trapdoor Commitments and Their Applications.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Contemporary cryptology.
Advanced courses in mathematics : CRM Barcelona, Birkhäuser, ISBN: 978-3-7643-7294-1, 2005

2004
Constant Round Authenticated Group Key Agreement via Distributed Computation.
Proceedings of the Public Key Cryptography, 2004

A fair micro-payment scheme for profit sharing in P2P networks.
Proceedings of the International Workshop on Hot Topics in Peer-to-Peer Systems, 2004

IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange.
Proceedings of the Advances in Cryptology, 2004

2003
A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

2002
Paillier's Trapdoor Function Hides up to <i>O</i>(<i>n</i>) Bits.
J. Cryptol., 2002

Coercion-Resistant Electronic Elections.
IACR Cryptol. ePrint Arch., 2002

The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm.
Proceedings of the Advances in Cryptology, 2002

2001
The Bit Security of Paillier's Encryption Scheme and Its Applications.
Proceedings of the Advances in Cryptology, 2001

Paillier's cryptosystem revisited.
Proceedings of the CCS 2001, 2001

2000
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications.
J. Comput. Syst. Sci., 2000

Color opponency watermarking scheme for digital images.
Proceedings of the Security and Watermarking of Multimedia Contents II, 2000

Computing Inverses over a Shared Secret Modulus.
Proceedings of the Advances in Cryptology, 2000

An Efficient Algorithm for the Approximate Median Selection Problem.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Robust Watermarking for Images Based on Color Manipulation.
Proceedings of the Information Hiding, Third International Workshop, 1999

1996
Learning Sat-<i>k</i>-DNF Formulas from Membership Queries.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996


  Loading...