( en | de | ru )

 

Disambiguation of "Visconti, Ivan"

Author of the publication

copydeleteadd this publication to your clipboard
Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, Italy, September 10-12, 2008. Proceedings

, , and (Eds.) SCN, volume 5229 of Lecture Notes in Computer Science, Springer, (2008)

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.

Oxana Ivanova-Chessex

Marian Ivanov

Natalie Ivanits

Elizaveta Ivanova

Tetyana Ivanovska

 

Other publications of authors with the same name

A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles., , , and . IACR Cryptology ePrint Archive, (2015)A secure and private system for subscription-based remote services., and . ACM Trans. Inf. Syst. Secur., 6 (4): 472-500 (2003)An Anonymous Credential System and a Privacy-Aware PKI., and . ACISP, volume 2727 of Lecture Notes in Computer Science, page 27-38. Springer, (2003)Efficient Zero Knowledge on the Internet.. ICALP (2), volume 4052 of Lecture Notes in Computer Science, page 22-33. Springer, (2006)An Efficient and Usable Multi-show Non-transferable Anonymous Credential System., and . Financial Cryptography, volume 3110 of Lecture Notes in Computer Science, page 196-211. Springer, (2004)On constant-round concurrent non-malleable proof systems., , and . Inf. Process. Lett., 111 (18): 883-890 (2011)Secure Blockchain-Based Supply Chain Management with Verifiable Digital Twins., , , and . CoRR, (2021)Digital Contact Tracing Solutions: Promises, Pitfalls and Challenges., , , , and . IACR Cryptol. ePrint Arch., (2022)Efficient NIZK Arguments with Straight-Line Simulation and Extraction., and . CANS, volume 13641 of Lecture Notes in Computer Science, page 3-22. Springer, (2022)Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments., , and . Public Key Cryptography, volume 6056 of Lecture Notes in Computer Science, page 193-208. Springer, (2010)