Daniele Venturi

Affiliations:
  • Sapienza University of Rome, Italy
  • University of Trento, Italy (former)


According to our database1, Daniele Venturi authored at least 68 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A compiler for multi-key homomorphic signatures for Turing machines.
Theor. Comput. Sci., 2021

Cryptographic reverse firewalls for interactive proof systems.
Theor. Comput. Sci., 2021

Immunization against complete subversion without random oracles.
Theor. Comput. Sci., 2021

Match Me if You Can: Matchmaking Encryption and Its Applications.
J. Cryptol., 2021

Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity.
IACR Cryptol. ePrint Arch., 2021

Shielded Computations in Smart Contracts Overcoming Forks.
Proceedings of the Financial Cryptography and Data Security, 2021

2020
Subversion-resilient signatures: Definitions, constructions and applications.
Theor. Comput. Sci., 2020

Continuously Non-malleable Codes in the Split-State Model.
J. Cryptol., 2020

Non-malleable Encryption: Simpler, Shorter, Stronger.
J. Cryptol., 2020

On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs.
IACR Cryptol. ePrint Arch., 2020

Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model.
IACR Cryptol. ePrint Arch., 2020

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
IACR Cryptol. ePrint Arch., 2020

Vision: What If They All Die? Crypto Requirements For Key People.
Proceedings of the IEEE European Symposium on Security and Privacy Workshops, 2020

2019
Continuously non-malleable codes with split-state refresh.
Theor. Comput. Sci., 2019

Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate.
IACR Cryptol. ePrint Arch., 2019

Rate-Optimizing Compilers for Continuously Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2019

Continuously Non-Malleable Secret Sharing for General Access Structures.
IACR Cryptol. ePrint Arch., 2019

The Rush Dilemma: Attacking and Repairing Smart Contracts on Forking Blockchains.
IACR Cryptol. ePrint Arch., 2019

A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Affordable Security or Big Guy vs Small Guy - Does the Depth of Your Pockets Impact Your Protocols?
Proceedings of the Security Protocols XXVII, 2019

Multi-Covert Channel Attack in the Cloud.
Proceedings of the 6th International Conference on Software Defined Systems, 2019

Public Immunization Against Complete Subversion Without Random Oracles.
Proceedings of the Applied Cryptography and Network Security, 2019

2018
Fiat-Shamir for highly sound protocols is instantiable.
Theor. Comput. Sci., 2018

Outsourced pattern matching.
Int. J. Inf. Sec., 2018

Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2018

Secure Multi-Party Computation from Strongly Uniform Key Agreement.
IACR Cryptol. ePrint Arch., 2018

Non-monotonic Security Protocols and Failures in Financial Intermediation.
Proceedings of the Security Protocols XXVI, 2018

FuturesMEX: Secure, Distributed Futures Market Exchange.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Secure Outsourcing of Cryptographic Circuits Manufacturing.
Proceedings of the Provable Security, 2018

2017
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model.
Theor. Comput. Sci., 2017

Naor-Yung paradigm with shared randomness and applications.
Theor. Comput. Sci., 2017

Efficient Authentication from Hard Learning Problems.
J. Cryptol., 2017

Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier.
J. Cryptol., 2017

Non-Malleable Codes for Space-Bounded Tampering.
IACR Cryptol. ePrint Arch., 2017

Securing Underwater Communications: Key Agreement based on Fully Hashed MQV.
Proceedings of the International Conference on Underwater Networks & Systems, 2017

The Seconomics (Security-Economics) Vulnerabilities of Decentralized Autonomous Organizations.
Proceedings of the Security Protocols XXV, 2017

2016
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits.
IEEE Trans. Inf. Theory, 2016

Rate-limited secure function evaluation.
Theor. Comput. Sci., 2016

Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience.
IACR Cryptol. ePrint Arch., 2016

Redactable Blockchain - or - Rewriting History in Bitcoin and Friends.
IACR Cryptol. ePrint Arch., 2016

Secure Outsourcing of Circuit Manufacturing.
IACR Cryptol. ePrint Arch., 2016

Entangled cloud storage.
Future Gener. Comput. Syst., 2016

2015
Chosen-Ciphertext Security from Subset Sum.
IACR Cryptol. ePrint Arch., 2015

Predictable Arguments of Knowledge.
IACR Cryptol. ePrint Arch., 2015

Non-Malleable Encryption: Simpler, Shorter, Stronger.
IACR Cryptol. ePrint Arch., 2015

Subversion-Resilient Signature Schemes.
IACR Cryptol. ePrint Arch., 2015

A Tamper and Leakage Resilient von Neumann Architecture.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

(De-)Constructing TLS 1.3.
Proceedings of the Progress in Cryptology - INDOCRYPT 2015, 2015

Secure Data Sharing and Processing in Heterogeneous Clouds.
Proceedings of the 1st International Conference on Cloud Forward: From Distributed to Complete Computing, 2015

Entangled Encodings and Data Entanglement.
Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015

2014
Leakage-Resilient Signatures with Graceful Degradation.
IACR Cryptol. ePrint Arch., 2014

On the Connection between Leakage Tolerance and Adaptive Security.
IACR Cryptol. ePrint Arch., 2014

(De-)Constructing TLS.
IACR Cryptol. ePrint Arch., 2014

A Tamper and Leakage Resilient Random Access Machine.
IACR Cryptol. ePrint Arch., 2014

Continuous Non-malleable Codes.
IACR Cryptol. ePrint Arch., 2014

Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation.
IACR Cryptol. ePrint Arch., 2014

The Chaining Lemma and its application.
IACR Cryptol. ePrint Arch., 2014

A Second Look at Fischlin's Transformation.
IACR Cryptol. ePrint Arch., 2014

From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2014

A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations.
Proceedings of the Cryptography and Information Security in the Balkans, 2014

2013
Anonymity-preserving Public-Key Encryption: A Constructive Approach.
IACR Cryptol. ePrint Arch., 2013

Rate-Limited Secure Function Evaluation: Definitions and Constructions.
IACR Cryptol. ePrint Arch., 2013

2012
On the Non-malleability of the Fiat-Shamir Transform.
IACR Cryptol. ePrint Arch., 2012

2011
Security & Indistinguishability in the Presence of Traffic Analysis.
IACR Cryptol. ePrint Arch., 2011

Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience.
IACR Cryptol. ePrint Arch., 2011

2009
Leakage-Resilient Storage.
IACR Cryptol. ePrint Arch., 2009

Lecture Notes on Algorithmic Number Theory.
Electron. Colloquium Comput. Complex., 2009

Inadequacy of the Queue-Based Max-Weight Optimal Scheduler on Wireless Links with TCP Sources.
Proceedings of IEEE International Conference on Communications, 2009


  Loading...