( en | de | ru )

 

Disambiguation of "Segev, Gil"

Author of the publication

copydeleteadd this publication to your clipboard
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varSigma $-Protocols.

, and . CRYPTO (1), volume 12825 of Lecture Notes in Computer Science, page 222-250. Springer, (2021)

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.

Mariana Gil

Horst Gil

Gil Benkö

Isabelle Gil

Thomas Gil

 

Other publications of authors with the same name

More Constructions of Lossy and Correlation-Secure Trapdoor Functions., , , , and . J. Cryptol., 26 (1): 39-74 (2013)Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction., and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 77-107. Springer, (2020)Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification., , and . Electron. Colloquium Comput. Complex., (2011)Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity.. Commun. ACM, 66 (5): 90 (May 2023)Function-Private Functional Encryption in the Private-Key Setting., and . TCC (2), volume 9015 of Lecture Notes in Computer Science, page 306-324. Springer, (2015)Strengthening the Security of Encrypted Databases: Non-transitive JOINs., , and . TCC (2), volume 10678 of Lecture Notes in Computer Science, page 631-661. Springer, (2017)David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware., and . EUROCRYPT, volume 4965 of Lecture Notes in Computer Science, page 527-544. Springer, (2008)Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing., and . Algorithmica, 56 (4): 529-549 (2010)Multidisciplinary Research in e-Health: Challenges and Thoughts., , , and . ICT4AWE, page 250-255. SCITEPRESS, (2020)Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models., , and . CRYPTO, volume 4117 of Lecture Notes in Computer Science, page 214-231. Springer, (2006)