( en | de | ru )

 

Disambiguation of "Simkin, Mark"

Author of the publication

copydeleteadd this publication to your clipboard
Compact Zero-Knowledge Proofs of Small Hamming Weight.

, , , , and . Public Key Cryptography (2), volume 10770 of Lecture Notes in Computer Science, page 530-560. Springer, (2018)

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.

Mark Yampolsky

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Mark Schütte

Crf2 - ein neues Antigen von Aspergillus fumigatus. TU Braunschweig, (2009)

Mark Yampolskiy

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Ana Markovi

Experimental and theoretical analysis of the mass transport through porous glass membranes with different pore diameters. Uni Magdeburg, (2009)

Adolf Mark

 

Other publications of authors with the same name

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free., , , , , , and . IEEE Trans. Inf. Theory, 68 (12): 8197-8227 (2022)The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free., , , , , , and . EUROCRYPT (2), volume 12697 of Lecture Notes in Computer Science, page 408-437. Springer, (2021)Squirrel: Efficient Synchronized Multi-Signatures from Lattices., , and . CCS, page 1109-1123. ACM, (2022)Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures., , , , , , and . CRYPTO (2), volume 11693 of Lecture Notes in Computer Science, page 510-539. Springer, (2019)Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More., , and . IACR Cryptol. ePrint Arch., (2024)Continuously Non-malleable Codes with Split-State Refresh., , , and . ACNS, volume 10892 of Lecture Notes in Computer Science, page 121-139. Springer, (2018)Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long., and . SCN, volume 12238 of Lecture Notes in Computer Science, page 566-578. Springer, (2020)Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings., , and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 799-829. Springer, (2018)Use your Brain! Arithmetic 3PC For Any Modulus with Active Security., , , , and . IACR Cryptology ePrint Archive, (2019)Optimal Oblivious Priority Queues and Offline Oblivious RAM., , and . IACR Cryptology ePrint Archive, (2019)