Follow
Luisa Siniscalchi
Luisa Siniscalchi
Verified email at cs.au.dk - Homepage
Title
Cited by
Cited by
Year
Concurrent non-malleable commitments (and more) in 3 rounds
M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti
Annual International Cryptology Conference, 270-299, 2016
502016
Improved OR-composition of sigma-protocols
M Ciampi, G Persiano, A Scafuro, L Siniscalchi, I Visconti
Theory of Cryptography Conference, 112-141, 2016
432016
Four-round concurrent non-malleable commitments from one-way functions
M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti
Annual International Cryptology Conference, 127-157, 2017
402017
Online/offline OR composition of sigma protocols
M Ciampi, G Persiano, A Scafuro, L Siniscalchi, I Visconti
Annual International Conference on the Theory and Applications of …, 2016
372016
A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
M Ciampi, G Persiano, L Siniscalchi, I Visconti
Theory of Cryptography Conference, 83-111, 2016
362016
Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti
Theory of Cryptography Conference, 711-742, 2017
332017
Round-optimal secure two-party computation from trapdoor permutations
M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti
Theory of Cryptography Conference, 678-710, 2017
302017
Publicly verifiable proofs from blockchains
A Scafuro, L Siniscalchi, I Visconti
IACR International Workshop on Public Key Cryptography, 374-401, 2019
152019
Balancing privacy and accountability in blockchain identity management
I Damgård, C Ganesh, H Khoshakhlagh, C Orlandi, L Siniscalchi
Cryptographers’ Track at the RSA Conference, 552-576, 2021
14*2021
How to extract useful randomness from unreliable sources
D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti
Annual International Conference on the Theory and Applications of …, 2020
122020
PRUCC-RM: permission-role-usage cardinality constrained role mining
C Blundo, S Cimato, L Siniscalchi
2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC …, 2017
102017
Managing constraints in role based access control
C Blundo, S Cimato, L Siniscalchi
IEEE Access 8, 140497-140511, 2020
82020
Multiparty computation with covert security and public verifiability
P Scholl, M Simkin, L Siniscalchi
Cryptology ePrint Archive, 2021
72021
4-round concurrent non-malleable commitments from one-way functions
M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti
Cryptology ePrint Archive, 2016
72016
Broadcast-optimal two round MPC with an honest majority
I Damgård, B Magri, D Ravi, L Siniscalchi, S Yakoubov
Annual International Cryptology Conference, 155-184, 2021
62021
Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
I Damgård, T Kazana, M Obremski, V Raj, L Siniscalchi
Theory of Cryptography Conference, 225-254, 2018
62018
On Round-Efficient Non-Malleable Protocols.
M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti
IACR Cryptol. ePrint Arch. 2016, 621, 2016
52016
Multi-client functional encryption for separable functions
M Ciampi, L Siniscalchi, H Waldner
IACR International Conference on Public-Key Cryptography, 724-753, 2021
42021
Targeted advertising that protects the privacy of social networks users
C Blundo, C De Maio, M Parente, L Siniscalchi
Hum. Cent. Comput. Inf. Sci 11, 18, 2021
42021
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.
D Aggarwal, M Obremski, JL Ribeiro, M Simkin, L Siniscalchi
IACR Cryptol. ePrint Arch. 2020, 1371, 2020
4*2020
The system can't perform the operation now. Try again later.
Articles 1–20