Luisa Siniscalchi

Orcid: 0000-0003-1813-1132

Affiliations:
  • Aarhus University, Denmark


According to our database1, Luisa Siniscalchi authored at least 43 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Round and Computational Efficiency of Multi-party Protocols
Information Security and Cryptography, Springer, ISBN: 978-3-031-92373-9, 2026

2025
Broadcast-Optimal Secure Computation From Black-Box Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2025

Information-Theoretic Broadcast-Optimal MPC.
IACR Cryptol. ePrint Arch., 2025

Rewardable Naysayer Proofs.
IACR Cryptol. ePrint Arch., 2025

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Incremental Time-Deniable Signatures.
Proceedings of the Computer Security - ESORICS 2024, 2024

Black-Box (and Fast) Non-malleable Zero Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Heuristics for constrained role mining in the post-processing framework.
J. Ambient Intell. Humaniz. Comput., 2023

Broadcast-Optimal Four-Round MPC in the Plain Model.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels.
Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

Minimizing Setup in Broadcast-Optimal Two Round MPC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.
IEEE Trans. Inf. Theory, 2022

Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations.
IACR Cryptol. ePrint Arch., 2022

Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints.
Comput. J., 2022

Four-Round Black-Box Non-malleable Schemes from One-Way Permutations.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

On Sufficient Oracles for Secure Computation with Identifiable Abort.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Round-Optimal Multi-party Computation with Identifiable Abort.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Multiparty Computation with Covert Security and Public Verifiability.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021
Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Multi-Client Functional Encryption for Separable Functions.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Balancing Privacy and Accountability in Blockchain Identity Management.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Broadcast-Optimal Two Round MPC with an Honest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Broadcast-Optimal Two Round MPC with an Honest Majority.
IACR Cryptol. ePrint Arch., 2020

Balancing Privacy and Accountability in Blockchain Transactions.
IACR Cryptol. ePrint Arch., 2020

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.
IACR Cryptol. ePrint Arch., 2020

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
IACR Cryptol. ePrint Arch., 2020

Managing Constraints in Role Based Access Control.
IEEE Access, 2020

How to Extract Useful Randomness from Unreliable Sources.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Publicly Verifiable Proofs from Blockchains.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

An intelligent and private method to profile social network users.
Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019

2018
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

PostProcessing in Constrained Role Mining.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2018, 2018

2017
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

PRUCC-RM: Permission-Role-Usage Cardinality Constrained Role Mining.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

2016
On Round-Efficient Non-Malleable Protocols.
IACR Cryptol. ePrint Arch., 2016

A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Improved OR-Composition of Sigma-Protocols.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Online/Offline OR Composition of Sigma Protocols.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Concurrent Non-Malleable Commitments (and More) in 3 Rounds.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016


  Loading...