( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A certificateless approach to onion routing.

, , и . Int. J. Inf. Sec., 16 (3): 327-343 (2017)

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.

Roberto Fiore

Silvestro Fiore

Bianca Marisa Fiore

Erna Fiorentini

Dario Piano

 

Другие публикации лиц с тем же именем

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