CIAMPI, MICHELE
CIAMPI, MICHELE
Dipartimento di Ingegneria dell'Informazione ed Elettrica e Matematica applicata/DIEM
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
2016-01-01 Ciampi, Michele; Persiano, Giuseppe; Siniscalchi, Luisa; Visconti, Ivan
Black-Box (and Fast) Non-malleable Zero Knowledge
2024-01-01 Botta, V.; Ciampi, M.; Orsini, E.; Siniscalchi, L.; Visconti, I.
Concurrent non-malleable commitments (and more) in 3 rounds
2016-01-01 Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
2017-01-01 Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan
Efficient NIZK Arguments with Straight-Line Simulation and Extraction
2022-01-01 Ciampi, M.; Visconti, I.
Four-round concurrent non-malleable commitments from one-way functions
2017-01-01 Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan
Improved OR-Composition of Sigma-Protocols
2016-01-01 Ciampi, Michele; Persiano, Giuseppe; Scafuro, Alessandra; Siniscalchi, Luisa; Visconti, Ivan
Online/offline or composition of sigma protocols
2016-01-01 Ciampi, Michele; Persiano, Giuseppe; Scafuro, Alessandra; Siniscalchi, Luisa; Visconti, Ivan
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
2017-01-01 Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles | 1-gen-2016 | Ciampi, Michele; Persiano, Giuseppe; Siniscalchi, Luisa; Visconti, Ivan | |
| Black-Box (and Fast) Non-malleable Zero Knowledge | 1-gen-2024 | Botta, V.; Ciampi, M.; Orsini, E.; Siniscalchi, L.; Visconti, I. | |
| Concurrent non-malleable commitments (and more) in 3 rounds | 1-gen-2016 | Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan | |
| Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds | 1-gen-2017 | Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan | |
| Efficient NIZK Arguments with Straight-Line Simulation and Extraction | 1-gen-2022 | Ciampi, M.; Visconti, I. | |
| Four-round concurrent non-malleable commitments from one-way functions | 1-gen-2017 | Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan | |
| Improved OR-Composition of Sigma-Protocols | 1-gen-2016 | Ciampi, Michele; Persiano, Giuseppe; Scafuro, Alessandra; Siniscalchi, Luisa; Visconti, Ivan | |
| Online/offline or composition of sigma protocols | 1-gen-2016 | Ciampi, Michele; Persiano, Giuseppe; Scafuro, Alessandra; Siniscalchi, Luisa; Visconti, Ivan | |
| Round-Optimal Secure Two-Party Computation from Trapdoor Permutations | 1-gen-2017 | Ciampi, Michele; Ostrovsky, Rafail; Siniscalchi, Luisa; Visconti, Ivan |