Luisa Siniscalchi

Available identifiers

zbMath Open siniscalchi.luisaDBLP167/2782WikidataQ112707751 ScholiaQ112707751MaRDI QIDQ826290

List of research outcomes

Publication	Date of Publication	Type
Black-box (and fast) non-malleable zero knowledge	2024-12-13	Paper
Broadcast-optimal two round MPC with asynchronous peer-to-peer channels	2024-10-16	Paper
Broadcast-optimal four-round MPC in the plain model	2024-08-02	Paper
Multiparty computation with covert security and public verifiability	2024-06-25	Paper
List oblivious transfer and applications to round-optimal black-box multiparty coin tossing	2024-02-02	Paper
Minimizing setup in broadcast-optimal two round MPC	2023-12-08	Paper
Four-round black-box non-malleable schemes from one-way permutations	2023-08-14	Paper
On sufficient oracles for secure computation with identifiable abort	2023-07-25	Paper
Round-optimal multi-party computation with identifiable abort	2022-08-30	Paper
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors	2022-08-19	Paper
Broadcast-optimal two round MPC with an honest majority	2022-04-22	Paper
Multi-client functional encryption for separable functions	2021-12-21	Paper
Publicly verifiable zero knowledge from (collapsing) blockchains	2021-12-21	Paper
Balancing privacy and accountability in blockchain identity management	2021-12-20	Paper
How to extract useful randomness from unreliable sources	2021-12-01	Paper
Publicly verifiable proofs from blockchains	2020-01-28	Paper
Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments	2018-12-06	Paper
Round-optimal secure two-party computation from trapdoor permutations	2018-01-19	Paper
Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds	2018-01-19	Paper
Four-round concurrent non-malleable commitments from one-way functions	2017-11-15	Paper
Concurrent Non-Malleable Commitments (and More) in 3 Rounds	2016-11-09	Paper
Online/Offline OR Composition of Sigma Protocols	2016-07-15	Paper
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles	2016-04-08	Paper
Improved OR-Composition of Sigma-Protocols	2016-04-08	Paper

Research outcomes over time

This page was built for person: Luisa Siniscalchi