Luisa Siniscalchi

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