Luisa Siniscalchi

发表

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory

Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, 2020, IACR Cryptol. ePrint Arch..

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations

Rafail Ostrovsky, Ivan Visconti, Luisa Siniscalchi, 2017, IACR Cryptol. ePrint Arch..

Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds

Rafail Ostrovsky, Ivan Visconti, Luisa Siniscalchi, 2017, IACR Cryptol. ePrint Arch..

Multi-Client Functional Encryption for Separable Functions

Luisa Siniscalchi, Michele Ciampi, Hendrik Waldner, 2020, IACR Cryptol. ePrint Arch..

Broadcast-Optimal Two Round MPC with an Honest Majority

Luisa Siniscalchi, Bernardo Magri, Ivan Damg̊ard, 2020, IACR Cryptol. ePrint Arch..

PRUCC-RM: Permission-Role-Usage Cardinality Constrained Role Mining

Stelvio Cimato, Carlo Blundo, Luisa Siniscalchi, 2017, 2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC).

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

Rafail Ostrovsky, Ivan Visconti, Luisa Siniscalchi, 2016, CRYPTO.

Online/Offline OR Composition of Sigma Protocols

Ivan Visconti, Giuseppe Persiano, Luisa Siniscalchi, 2016, IACR Cryptol. ePrint Arch..

A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles

Ivan Visconti, Giuseppe Persiano, Luisa Siniscalchi, 2016, IACR Cryptol. ePrint Arch..

Publicly Verifiable Proofs from Blockchains

Ivan Visconti, Luisa Siniscalchi, Alessandra Scafuro, 2019, IACR Cryptol. ePrint Arch..

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors

Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, 2020, IACR Cryptol. ePrint Arch..

Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains

Ivan Visconti, Luisa Siniscalchi, Alessandra Scafuro, 2020, IACR Cryptol. ePrint Arch..

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments

Ivan Damgård, Maciej Obremski, Luisa Siniscalchi, 2018, IACR Cryptol. ePrint Arch..

Edinburgh Research Explorer Four-Round Concurrent Non-Malleable Commitments from One-Way Functions

Rafail Ostrovsky, Ivan Visconti, Luisa Siniscalchi, 2016 .

Delayed-Input and Non-Malleable Cryptographic Protocols

Luisa Siniscalchi, Luisa Siniscalchi, 2018 .

How to Extract Useful Randomness from Unreliable Sources

Ivan Visconti, Divesh Aggarwal, Maciej Obremski, 2020, IACR Cryptol. ePrint Arch..

PostProcessing in Constrained Role Mining

Stelvio Cimato, Carlo Blundo, Luisa Siniscalchi, 2018, IDEAL.

An intelligent and private method to profile social network users

Mimmo Parente, Carmen De Maio, Luisa Siniscalchi, 2019, 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE).

Improved OR Composition of Sigma-Protocols

Ivan Visconti, Giuseppe Persiano, Luisa Siniscalchi, 2016, IACR Cryptol. ePrint Arch..

Balancing Privacy and Accountability in Blockchain Transactions

Ivan Damgård, Luisa Siniscalchi, Claudio Orlandi, 2020, IACR Cryptology ePrint Archive.

On Round-Efficient Non-Malleable Protocols

Rafail Ostrovsky, Ivan Visconti, Luisa Siniscalchi, 2016, IACR Cryptol. ePrint Arch..

On Sufficient Oracles for Secure Computation with Identifiable Abort

Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov, 2021, IACR Cryptol. ePrint Arch..

Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints

Stelvio Cimato, Carlo Blundo, Luisa Siniscalchi, 2021 .

Multiparty Computation with Covert Security and Public Verifiability

Mark Simkin, Luisa Siniscalchi, Peter Scholl, 2021, IACR Cryptol. ePrint Arch..