default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuisa Siniscalchi
Person information
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Vincenzo Botta
, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti:
Black-Box (and Fast) Non-malleable Zero Knowledge. CRYPTO (9) 2024: 458-490- [c26]Luisa Siniscalchi, Ivan Visconti:
Incremental Time-Deniable Signatures. ESORICS (4) 2024: 414-434 - 2023
- [j4]Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi:
Heuristics for constrained role mining in the post-processing framework. J. Ambient Intell. Humaniz. Comput. 14(8): 9925-9937 (2023) - [c25]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. CRYPTO (1) 2023: 459-488 - [c24]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Minimizing Setup in Broadcast-Optimal Two Round MPC. EUROCRYPT (2) 2023: 129-158 - [c23]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. LATINCRYPT 2023: 87-106 - [c22]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: 3-32 - [i25]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: 1187 (2023) - [i24]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: 1512 (2023) - [i23]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: 1739 (2023) - [i22]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. IACR Cryptol. ePrint Arch. 2023: 1742 (2023) - 2022
- [j3]Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi:
Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints. Comput. J. 65(6): 1386-1411 (2022) - [j2]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Trans. Inf. Theory 68(8): 5475-5495 (2022) - [c21]Peter Scholl, Mark Simkin, Luisa Siniscalchi:
Multiparty Computation with Covert Security and Public Verifiability. ITC 2022: 8:1-8:13 - [c20]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-party Computation with Identifiable Abort. EUROCRYPT (1) 2022: 335-364 - [c19]Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov:
On Sufficient Oracles for Secure Computation with Identifiable Abort. SCN 2022: 494-515 - [c18]Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi:
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. TCC (2) 2022: 300-329 - [i21]Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Minimizing Setup in Broadcast-Optimal Two Round MPC. IACR Cryptol. ePrint Arch. 2022: 293 (2022) - [i20]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-Party Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2022: 645 (2022) - [i19]Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi:
Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations. IACR Cryptol. ePrint Arch. 2022: 1543 (2022) - 2021
- [c17]Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with an Honest Majority. CRYPTO (2) 2021: 155-184 - [c16]Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi:
Balancing Privacy and Accountability in Blockchain Identity Management. CT-RSA 2021: 552-576 - [c15]Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. Public Key Cryptography (2) 2021: 469-498 - [c14]Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner:
Multi-Client Functional Encryption for Separable Functions. Public Key Cryptography (1) 2021: 724-753 - [i18]Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov:
On Sufficient Oracles for Secure Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2021: 151 (2021) - [i17]Peter Scholl, Mark Simkin, Luisa Siniscalchi:
Multiparty Computation with Covert Security and Public Verifiability. IACR Cryptol. ePrint Arch. 2021: 366 (2021) - 2020
- [j1]Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi:
Managing Constraints in Role Based Access Control. IEEE Access 8: 140497-140511 (2020) - [c13]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) 2020: 343-372 - [i16]Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner:
Multi-Client Functional Encryption for Separable Functions. IACR Cryptol. ePrint Arch. 2020: 219 (2020) - [i15]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. IACR Cryptol. ePrint Arch. 2020: 259 (2020) - [i14]Ivan Damgård, Bernardo Magri, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with an Honest Majority. IACR Cryptol. ePrint Arch. 2020: 1254 (2020) - [i13]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. IACR Cryptol. ePrint Arch. 2020: 1371 (2020) - [i12]Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. IACR Cryptol. ePrint Arch. 2020: 1435 (2020) - [i11]Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi:
Balancing Privacy and Accountability in Blockchain Transactions. IACR Cryptol. ePrint Arch. 2020: 1511 (2020)
2010 – 2019
- 2019
- [c12]Carlo Blundo, Carmen De Maio, Mimmo Parente, Luisa Siniscalchi:
An intelligent and private method to profile social network users. FUZZ-IEEE 2019: 1-6 - [c11]Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Publicly Verifiable Proofs from Blockchains. Public Key Cryptography (1) 2019: 374-401 - [i10]Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Publicly Verifiable Proofs from Blockchains. IACR Cryptol. ePrint Arch. 2019: 66 (2019) - [i9]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. IACR Cryptol. ePrint Arch. 2019: 1156 (2019) - 2018
- [c10]Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi:
PostProcessing in Constrained Role Mining. IDEAL (1) 2018: 204-214 - [c9]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: 225-254 - [i8]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: 596 (2018) - 2017
- [c8]Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi:
PRUCC-RM: Permission-Role-Usage Cardinality Constrained Role Mining. COMPSAC (2) 2017: 149-154 - [c7]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions. CRYPTO (2) 2017: 127-157 - [c6]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. TCC (1) 2017: 678-710 - [c5]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: 711-742 - [i7]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2017: 920 (2017) - [i6]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: 931 (2017) - 2016
- [c4]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. CRYPTO (3) 2016: 270-299 - [c3]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Online/Offline OR Composition of Sigma Protocols. EUROCRYPT (2) 2016: 63-92 - [c2]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: 83-111 - [c1]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Improved OR-Composition of Sigma-Protocols. TCC (A2) 2016: 112-141 - [i5]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Online/Offline OR Composition of Sigma Protocols. IACR Cryptol. ePrint Arch. 2016: 175 (2016) - [i4]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. IACR Cryptol. ePrint Arch. 2016: 566 (2016) - [i3]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
On Round-Efficient Non-Malleable Protocols. IACR Cryptol. ePrint Arch. 2016: 621 (2016) - 2015
- [i2]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: 770 (2015) - [i1]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Improved OR Composition of Sigma-Protocols. IACR Cryptol. ePrint Arch. 2015: 810 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
