Ivan Visconti

sssistant professor

Dipartimento di Informatica ed Applicazioni Faculty of Mathematical Physical and Natural Sciences of the University of Salerno

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers29 papers

Sort

By YearBy Citation

Non-interactive Secure Computation from One-Way Functions

Saikrishna Badrinarayanan,Abhishek Jain,Rafail Ostrovsky,Ivan Visconti

ASIACRYPT, (2018): 118-138

Cited by5EIBibtex

Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions

Rafail Ostrovsky,Giuseppe Persiano,Daniele Venturi,Ivan Visconti

ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, (2018): 608-639

Cited by17EIBibtex

Delayed-Input Cryptographic Protocols

Ivan Visconti

CiE, pp.112-115, (2017)

EIBibtex

Concurrent Non-Malleable Commitments (and More) in 3 Rounds

Michele Ciampi,Rafail Ostrovsky, Luisa Siniscalchi,Ivan Visconti

IACR Cryptology ePrint Archive, (2016): 270-299

Cited by32EIBibtex

On Round-Efficient Non-Malleable Protocols

Michele Ciampi,Rafail Ostrovsky, Luisa Siniscalchi,Ivan Visconti

IACR Cryptology ePrint Archive, (2016)

Cited by5EIBibtex

New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs

Saikrishna Badrinarayanan,Dakshita Khurana,Rafail Ostrovsky,Ivan Visconti

IACR Cryptology ePrint Archive, (2016)

Cited by1EIBibtex

Impossibility of Black-Box Simulation Against Leakage Attacks

Rafail Ostrovsky,Giuseppe Persiano,Ivan Visconti

CRYPTO, (2015)

Cited by5EIBibtex

Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation

Rafail Ostrovsky,Giuseppe Persiano,Ivan Visconti

IACR Cryptology ePrint Archive, (2014)

EIBibtex

On Selective-Opening Attacks against Encryption Schemes

Rafail Ostrovsky,Vanishree Rao,Ivan Visconti

SCN, pp.578-597, (2014)

Cited by5EIBibtex

On Input Indistinguishable Proof Systems

Rafail Ostrovsky,Giuseppe Persiano,Ivan Visconti

ICALP, pp.895-906, (2014)

Cited by1EIBibtex

Black-box non-black-box zero knowledge

Vipul Goyal,Rafail Ostrovsky,Alessandra Scafuro,Ivan Visconti

STOC, (2014): 515-524

Cited by20EIBibtex

Statistical Concurrent Non-Malleable Zero Knowledge

Claudio Orlandi,Rafail Ostrovsky,Vanishree Rao,Amit Sahai,Ivan Visconti

TCC, (2014): 167-191

Cited by4EIBibtex

Simultaneous Resettability from One-Way Functions

Kai-Min Chung,Rafail Ostrovsky,Rafael Pass,Ivan Visconti

FOCS, pp.60-69, (2013)

Cited by12EIBibtex

Concurrent zero knowledge in the bounded player model

Vipul Goyal,Abhishek Jain,Rafail Ostrovsky,Silas Richelson,Ivan Visconti

IACR Cryptology ePrint Archive, (2013): 60-79

Cited by11EIBibtex

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model

Vipul Goyal,Abhishek Jain,Rafail Ostrovsky,Silas Richelson,Ivan Visconti

ASIACRYPT, (2013): 21-40

Cited by7EIBibtex

Impossibility Results for Static Input Secure Computation

Sanjam Garg,Abishek Kumarasubramanian,Rafail Ostrovsky,Ivan Visconti

ADVANCES IN CRYPTOLOGY - CRYPTO 2012, (2012): 424-442

Cited by22EIBibtex

Nearly simultaneously resettable black-box zero knowledge

Joshua Baron,Rafail Ostrovsky,Ivan Visconti

ICALP, pp.88-99, (2012)

Cited by2EIBibtex

Concurrent zero knowledge in the bounded player model. Cryptology ePrint Archive, Report 2012/279

Vipul Goyal,Silas Richelson,Ivan Visconti

(2012)

Bibtex

Constructing Non-malleable Commitments: A Black-Box Approach

Vipul Goyal,Chen-Kuei Lee,Rafail Ostrovsky,Ivan Visconti

Foundations of Computer Science, pp.51-60, (2012)

Cited by52EIWOSBibtex

Simultaneous Resettability from Collision Resistance

Rafail Ostrovsky,Ivan Visconti

Electronic Colloquium on Computational Complexity (ECCC), (2012): 164

Cited by19EIBibtex

View All

Base Info Papers Patents Projects