( en | de | ru )

 

Disambiguation of "Siniscalchi, Luisa"

Author of the publication

copydeleteadd this publication to your clipboard
Concurrent Non-Malleable Commitments (and More) in 3 Rounds.

, , , and . IACR Cryptology ePrint Archive, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Luisa Jurjanz

Luisa Conti

Luisa Kunz

Luisa Crones

Luisa Backhaus

 

Other publications of authors with the same name

Improved OR Composition of Sigma-Protocols., , , , and . IACR Cryptology ePrint Archive, (2015)On Sufficient Oracles for Secure Computation with Identifiable Abort., , and . IACR Cryptol. ePrint Arch., (2021)Multi-Client Functional Encryption for Separable Functions., , and . Public Key Cryptography (1), volume 12710 of Lecture Notes in Computer Science, page 724-753. Springer, (2021)Minimizing Setup in Broadcast-Optimal Two Round MPC., , , and . EUROCRYPT (2), volume 14005 of Lecture Notes in Computer Science, page 129-158. Springer, (2023)Round-Optimal Multi-party Computation with Identifiable Abort., , , and . EUROCRYPT (1), volume 13275 of Lecture Notes in Computer Science, page 335-364. Springer, (2022)List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing., , , and . CRYPTO (1), volume 14081 of Lecture Notes in Computer Science, page 459-488. Springer, (2023)A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles., , , and . IACR Cryptology ePrint Archive, (2015)Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions., , , and . IACR Cryptol. ePrint Arch., (2023)Balancing Privacy and Accountability in Blockchain Identity Management., , , , and . CT-RSA, volume 12704 of Lecture Notes in Computer Science, page 552-576. Springer, (2021)Broadcast-Optimal Two Round MPC with an Honest Majority., , , and . IACR Cryptol. ePrint Arch., (2020)