Luisa Siniscalchi

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 53

Top Topics

Automated Theorem Provers

Cardinality Constraints

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti
Black-Box (and Fast) Non-malleable Zero Knowledge. CRYPTO (9) (2024)
Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov
Broadcast-Optimal Four-Round MPC in the Plain Model. IACR Cryptol. ePrint Arch. 2023 (2023)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. CRYPTO (1) (2023)
Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
Minimizing Setup in Broadcast-Optimal Two Round MPC. EUROCRYPT (2) (2023)
Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. IACR Cryptol. ePrint Arch. 2023 (2023)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. IACR Cryptol. ePrint Arch. 2023 (2023)
Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov
Broadcast-Optimal Four-Round MPC in the Plain Model. TCC (2) (2023)
Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi
Heuristics for constrained role mining in the post-processing framework. J. Ambient Intell. Humaniz. Comput. 14 (8) (2023)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. IACR Cryptol. ePrint Arch. 2023 (2023)
Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. LATINCRYPT (2023)
Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. TCC (2) (2022)
Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
Minimizing Setup in Broadcast-Optimal Two Round MPC. IACR Cryptol. ePrint Arch. 2022 (2022)
Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi
Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations. IACR Cryptol. ePrint Arch. 2022 (2022)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Trans. Inf. Theory 68 (8) (2022)
Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner
Round-Optimal Multi-party Computation with Identifiable Abort. EUROCRYPT (1) (2022)
Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov
On Sufficient Oracles for Secure Computation with Identifiable Abort. SCN (2022)
Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner
Round-Optimal Multi-Party Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2022 (2022)
Peter Scholl, Mark Simkin, Luisa Siniscalchi
Multiparty Computation with Covert Security and Public Verifiability. ITC (2022)
Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi
Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints. Comput. J. 65 (6) (2022)
Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. Public Key Cryptography (2) (2021)
Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi
Balancing Privacy and Accountability in Blockchain Identity Management. CT-RSA (2021)
Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov
On Sufficient Oracles for Secure Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2021 (2021)
Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner
Multi-Client Functional Encryption for Separable Functions. Public Key Cryptography (1) (2021)
Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov
Broadcast-Optimal Two Round MPC with an Honest Majority. CRYPTO (2) (2021)
Peter Scholl, Mark Simkin, Luisa Siniscalchi
Multiparty Computation with Covert Security and Public Verifiability. IACR Cryptol. ePrint Arch. 2021 (2021)
Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner
Multi-Client Functional Encryption for Separable Functions. IACR Cryptol. ePrint Arch. 2020 (2020)
Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi
Balancing Privacy and Accountability in Blockchain Transactions. IACR Cryptol. ePrint Arch. 2020 (2020)
Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. IACR Cryptol. ePrint Arch. 2020 (2020)
Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi
Managing Constraints in Role Based Access Control. IEEE Access 8 (2020)
Ivan Damgård, Bernardo Magri, Luisa Siniscalchi, Sophia Yakoubov
Broadcast-Optimal Two Round MPC with an Honest Majority. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Luisa Siniscalchi, Ivan Visconti
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. IACR Cryptol. ePrint Arch. 2020 (2020)
Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Publicly Verifiable Proofs from Blockchains. IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Luisa Siniscalchi, Ivan Visconti
How to Extract Useful Randomness from Unreliable Sources. IACR Cryptol. ePrint Arch. 2019 (2019)
Carlo Blundo, Carmen De Maio, Mimmo Parente, Luisa Siniscalchi
An intelligent and private method to profile social network users. FUZZ-IEEE (2019)
Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Publicly Verifiable Proofs from Blockchains. Public Key Cryptography (1) (2019)
Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi
PostProcessing in Constrained Role Mining. IDEAL (1) (2018)
Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. IACR Cryptol. ePrint Arch. 2018 (2018)
Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. TCC (2) (2018)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. IACR Cryptol. ePrint Arch. 2017 (2017)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions. CRYPTO (2) (2017)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. TCC (1) (2017)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. TCC (1) (2017)
Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi
PRUCC-RM: Permission-Role-Usage Cardinality Constrained Role Mining. COMPSAC (2) (2017)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2017 (2017)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
On Round-Efficient Non-Malleable Protocols. IACR Cryptol. ePrint Arch. 2016 (2016)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. IACR Cryptol. ePrint Arch. 2016 (2016)
Michele Ciampi, Giuseppe Persiano, Luisa Siniscalchi, Ivan Visconti
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles. TCC (A2) (2016)
Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. CRYPTO (3) (2016)
Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Online/Offline OR Composition of Sigma Protocols. EUROCRYPT (2) (2016)
Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Improved OR-Composition of Sigma-Protocols. TCC (A2) (2016)
Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Online/Offline OR Composition of Sigma Protocols. IACR Cryptol. ePrint Arch. 2016 (2016)
Michele Ciampi, Giuseppe Persiano, Luisa Siniscalchi, Ivan Visconti
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles. IACR Cryptol. ePrint Arch. 2015 (2015)
Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti
Improved OR Composition of Sigma-Protocols. IACR Cryptol. ePrint Arch. 2015 (2015)