( en | de | ru )

 

Disambiguation of "Fiore, Dario"

Author of the publication

copydeleteadd this publication to your clipboard
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings.

, , , and . SCN, volume 13409 of Lecture Notes in Computer Science, page 639-662. Springer, (2022)

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.

Roberto Fiore

Silvestro Fiore

Bianca Marisa Fiore

Erna Fiorentini

Dario Piano

 

Other publications of authors with the same name

Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions., , , , and . ASIACRYPT (3), volume 13092 of Lecture Notes in Computer Science, page 3-33. Springer, (2021)Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage., , , , and . ASIACRYPT (2), volume 12492 of Lecture Notes in Computer Science, page 3-35. Springer, (2020)Zero-Knowledge Sets With Short Proofs., , , and . IEEE Trans. Inf. Theory, 57 (4): 2488-2502 (2011)Ring Signatures with User-Controlled Linkability., , , , and . ESORICS (2), volume 13555 of Lecture Notes in Computer Science, page 405-426. Springer, (2022)Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds., , , , , and . Public Key Cryptography, volume 9020 of Lecture Notes in Computer Science, page 355-376. Springer, (2015)Homomorphic Signatures with Efficient Verification for Polynomial Functions., , and . CRYPTO (1), volume 8616 of Lecture Notes in Computer Science, page 371-389. Springer, (2014)Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings., , , , and . CRYPTO (1), volume 10991 of Lecture Notes in Computer Science, page 597-627. Springer, (2018)Mon$Z_2^k$a: Fast Maliciously Secure Two Party Computation on $Z_2^k$., , , and . Public Key Cryptography (2), volume 12111 of Lecture Notes in Computer Science, page 357-386. Springer, (2020)Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them., , and . IACR Cryptol. ePrint Arch., (2024)Succinct Zero-Knowledge Batch Proofs for Set Accumulators., , , , , and . CCS, page 455-469. ACM, (2022)