( en | de | ru )

 

Disambiguation of "Crescenzo, Giovanni Di"

Author of the publication

copydeleteadd this publication to your clipboard
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio.

. MFCS, volume 2136 of Lecture Notes in Computer Science, page 292-303. Springer, (2001)

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.

Giovanni Di Favero

Giovanni Natale

Giovanni Bacigalupo

Giovanni Lamura

Giovanni Falcone

 

Other publications of authors with the same name

Encrypted-Input Obfuscation of Image Classifiers., , , , , and . DBSec, volume 12840 of Lecture Notes in Computer Science, page 136-156. Springer, (2021)On Single-Server Delegation Without Precomputation., and . SECRYPT, page 540-547. SCITEPRESS, (2023)A Group Testing Approach to Improved Corruption Localizing Hashing., and . IACR Cryptology ePrint Archive, (2011)Modeling cryptographic properties of voice and voice-based entity authentication., , and . Digital Identity Management, page 53-61. ACM, (2007)Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model., , and . CRYPTO, volume 3152 of Lecture Notes in Computer Science, page 237-253. Springer, (2004)Improved Setup Assumptions for 3-Round Resettable Zero Knowledge., , and . ASIACRYPT, volume 3329 of Lecture Notes in Computer Science, page 530-544. Springer, (2004)Foundations of Optical Encryption: A Candidate Short-Key Scheme., , and . NSS, volume 9408 of Lecture Notes in Computer Science, page 359-367. Springer, (2015)Private Selective Payment Protocols.. Financial Cryptography, volume 1962 of Lecture Notes in Computer Science, page 72-89. Springer, (2000)Zero-knowledge proofs of decision power: new protocols and optimal round-complexity., , and . ICICS, volume 1334 of Lecture Notes in Computer Science, page 17-27. Springer, (1997)Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model.. COCOON, volume 5609 of Lecture Notes in Computer Science, page 127-137. Springer, (2009)