Ivan Visconti

Orcid: 0000-0003-2381-5846

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


According to our database1, Ivan Visconti authored at least 115 papers between 2000 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Compact Proofs of Partial Knowledge for Overlapping CNF Formulae.
J. Cryptol., March, 2025

2024
Digital Contact Tracing Solutions: Promises, Pitfalls and Challenges.
IEEE Trans. Emerg. Top. Comput., 2024

Trust Nobody: Privacy-Preserving Proofs for Edited Photos with Your Laptop.
IACR Cryptol. ePrint Arch., 2024

Incremental Time-Deniable Signatures.
Proceedings of the Computer Security - ESORICS 2024, 2024

Data Redaction in Smart-Contract-Enabled Permissioned Blockchains.
Proceedings of the Sixth Distributed Ledger Technology Workshop (DLT 2024), 2024

Black-Box (and Fast) Non-malleable Zero Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

The Right to Be Zero-Knowledge Forgotten.
Proceedings of the 19th International Conference on Availability, Reliability and Security, 2024

2023
Doubly adaptive zero-knowledge proofs.
Theor. Comput. Sci., August, 2023

Privacy and Integrity Threats in Contact Tracing Systems and Their Mitigations.
IEEE Internet Comput., 2023

Secure Blockchain-Based Supply Chain Management with Verifiable Digital Twins.
Proceedings of the 2023 ACM Conference on Information Technology for Social Good, 2023

Preventing Content Cloning in NFT Collections.
Proceedings of the Applied Cryptography and Network Security Workshops, 2023

2022
Towards Data Redaction in Bitcoin.
IEEE Trans. Netw. Serv. Manag., December, 2022

Efficient Proofs of Knowledge for Threshold Relations.
IACR Cryptol. ePrint Arch., 2022

Efficient NIZK Arguments with Straight-Line Simulation and Extraction.
Proceedings of the Cryptology and Network Security - 21st International Conference, 2022

2021
The Blockchain Quadrilemma: When Also Computational Effectiveness Matters.
Proceedings of the IEEE Symposium on Computers and Communications, 2021

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

Terrorist Attacks for Fake Exposure Notifications in Contact Tracing Systems.
Proceedings of the Applied Cryptography and Network Security, 2021

2020
Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains.
IACR Cryptol. ePrint Arch., 2020

Black-Box Constructions of Bounded-Concurrent Secure Computation.
IACR Cryptol. ePrint Arch., 2020

TEnK-U: Terrorist Attacks for Fake Exposure Notifications in Contact Tracing Systems.
IACR Cryptol. ePrint Arch., 2020

Towards Defeating Mass Surveillance and SARS-CoV-2: The Pronto-C2 Fully Decentralized Automatic Contact Tracing System.
IACR Cryptol. ePrint Arch., 2020

2019
Publicly Verifiable Proofs from Blockchains.
IACR Cryptol. ePrint Arch., 2019

Non-Interactive Zero Knowledge Proofs in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2019

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

How to Extract Useful Randomness from Unreliable Sources.
IACR Cryptol. ePrint Arch., 2019

Universally Composable Secure Computation with Corrupted Tokens.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

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

Non-Interactive Secure Computation from One-Way Functions.
IACR Cryptol. ePrint Arch., 2018

2017
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds.
IACR Cryptol. ePrint Arch., 2017

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2017

Resettably-Sound Resettable Zero Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2017

Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model.
IACR Cryptol. ePrint Arch., 2017

Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Delayed-Input Cryptographic Protocols.
Proceedings of the Unveiling Dynamics and Complexity, 2017

2016
Online/Offline OR Composition of Sigma Protocols.
IACR Cryptol. ePrint Arch., 2016

On Round-Efficient Non-Malleable Protocols.
IACR Cryptol. ePrint Arch., 2016

Concurrent Non-Malleable Commitments (and More) in 3 Rounds.
IACR Cryptol. ePrint Arch., 2016

New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs.
IACR Cryptol. ePrint Arch., 2016

2015
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles.
IACR Cryptol. ePrint Arch., 2015

Improved OR Composition of Sigma-Protocols.
IACR Cryptol. ePrint Arch., 2015

Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Impossibility of Black-Box Simulation Against Leakage Attacks.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
The design and implementation of a secure CAPTCHA against man-in-the-middle attacks.
Secur. Commun. Networks, 2014

Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2014

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

Black-Box Non-Black-Box Zero Knowledge.
IACR Cryptol. ePrint Arch., 2014

Controlled Homomorphic Encryption: Definition and Construction.
IACR Cryptol. ePrint Arch., 2014

4-Round Resettably-Sound Zero Knowledge.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

On Selective-Opening Attacks against Encryption Schemes.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

On Input Indistinguishable Proof Systems.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Special Issue: Advances in Security for Communication Networks.
J. Comput. Secur., 2013

SmartK: Smart cards in operating systems at kernel level.
Inf. Secur. Tech. Rep., 2013

Reliable accounting in grids.
Int. J. High Perform. Comput. Netw., 2013

Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Simultaneous Resettability from One-Way Functions.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions.
IACR Cryptol. ePrint Arch., 2012

Concurrent Zero Knowledge in the Bounded Player Model.
IACR Cryptol. ePrint Arch., 2012

Impossibility Results for Static Input Secure Computation.
IACR Cryptol. ePrint Arch., 2012

Secure Database Commitments and Universal Arguments of Quasi Knowledge.
IACR Cryptol. ePrint Arch., 2012

Simultaneous Resettability from Collision Resistance.
Electron. Colloquium Comput. Complex., 2012

Simultaneously Resettable Arguments of Knowledge.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Nearly Simultaneously Resettable Black-Box Zero Knowledge.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Constructing Non-malleable Commitments: A Black-Box Approach.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

On Round-Optimal Zero Knowledge in the Bare Public-Key Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
On constant-round concurrent non-malleable proof systems.
Inf. Process. Lett., 2011

Revisiting Lower and Upper Bounds for Selective Decommitments.
IACR Cryptol. ePrint Arch., 2011

Resettable Statistical Zero Knowledge.
IACR Cryptol. ePrint Arch., 2011

Secure Set Intersection with Untrusted Hardware Tokens.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010
Enhancing RFID Security and Privacy by Physically Unclonable Functions.
Proceedings of the Towards Hardware-Intrinsic Security - Foundations and Practice, 2010

Impossibility Results for RFID Privacy Notions.
Trans. Comput. Sci., 2010

On Efficient Non-Interactive Oblivious Transfer with Tamper-Proof Hardware.
IACR Cryptol. ePrint Arch., 2010

Proxy Smart Card Systems.
Proceedings of the Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices, 2010

Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments.
Proceedings of the Public Key Cryptography, 2010

Increasing Privacy Threats in the Cyberspace: The Case of Italian E-Passports.
Proceedings of the Financial Cryptography and Data Security, 2010

On RFID Privacy with Mutual Authentication and Tag Corruption.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Simulation-Based Concurrent Non-malleable Commitments and Decommitments.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Location Privacy in RFID Applications.
Proceedings of the Privacy in Location-Based Applications, 2009

Collusion-Free Multiparty Computation in the Mediated Model.
Proceedings of the Advances in Cryptology, 2009

Anonymizer-Enabled Security and Privacy for RFID.
Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

Revisiting DoS Attacks and Privacy in RFID-Enabled Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

Co-sound Zero-Knowledge with Public Keys.
Proceedings of the Progress in Cryptology, 2009

2008
Constant-Round Concurrent Non-Malleable Commitments and Decommitments.
IACR Cryptol. ePrint Arch., 2008

Completely Non-malleable Encryption Revisited.
Proceedings of the Public Key Cryptography, 2008

Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

User Privacy in Transport Systems Based on RFID E-Tickets.
Proceedings of the 1st International Workshop on Privacy in Location-Based Applications, 2008

Improved Security Notions and Protocols for Non-transferable Identification.
Proceedings of the Computer Security, 2008

Collusion-Free Protocols in the Mediated Model.
Proceedings of the Advances in Cryptology, 2008

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

On Defining Proofs of Knowledge in the Bare Public Key Model.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2006
Constant-Round Concurrent NMWI and its relation to NMZK.
IACR Cryptol. ePrint Arch., 2006

Concurrent Non-Malleable Witness Indistinguishability and its Applications.
Electron. Colloquium Comput. Complex., 2006

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

On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Efficient Zero Knowledge on the Internet.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Securing Operating System Services Based on Smart Cards.
Proceedings of the Trust, 2005

Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Concurrent Zero Knowledge in the Public-Key Model.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

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

Impossibility and Feasibility Results for Zero Knowledge with Public Keys.
Proceedings of the Advances in Cryptology, 2005

2004
An Architecture for Kernel-Level Verification of Executables at Run Time.
Comput. J., 2004

Reliable Accounting in Grid Economic Transactions.
Proceedings of the Grid and Cooperative Computing, 2004

An Efficient and Usable Multi-show Non-transferable Anonymous Credential System.
Proceedings of the Financial Cryptography, 2004

Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model.
Proceedings of the Advances in Cryptology, 2004

Improved Setup Assumptions for 3-Round Resettable Zero Knowledge.
Proceedings of the Advances in Cryptology, 2004

2003
A secure and private system for subscription-based remote services.
ACM Trans. Inf. Syst. Secur., 2003

A Lightweight Security Model for WBEM.
Proceedings of the On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops, 2003

Anonymous Group Communication in Mobile Networks.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

An Anonymous Credential System and a Privacy-Aware PKI.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

2002
On authentication and privacy on the internet.
PhD thesis, 2002

A Format-Independent Architecture for Run-Time Integrity Checking of Executable Code.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

2000
User privacy issues regarding certificates and the TLS protocol: the design and implementation of the SPSL protocol.
Proceedings of the CCS 2000, 2000


  Loading...