Author of the publication

A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.

, , and . TCC, volume 7785 of Lecture Notes in Computer Science, page 243-262. Springer, (2013)

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.

 

Other publications of authors with the same name

OptORAMa: Optimal Oblivious RAM., , , , , and . EUROCRYPT (2), volume 12106 of Lecture Notes in Computer Science, page 403-432. Springer, (2020)Privacy-Preserving Search of Similar Patients in Genomic Data., , , and . Proc. Priv. Enhancing Technol., 2018 (4): 104-124 (2018)A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss., , and . EUROCRYPT (1), volume 13275 of Lecture Notes in Computer Science, page 120-149. Springer, (2022)Privacy-preserving portfolio pricing., , and . ICAIF, page 35:1-35:8. ACM, (2021)Limits on the Power of Indistinguishability Obfuscation and Functional Encryption., and . FOCS, page 191-209. IEEE Computer Society, (2015)Indistinguishability Obfuscation Does Not Reduce to Structured Languages., , and . Electron. Colloquium Comput. Complex., (2016)Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters., , , , , , , and . CCS, page 125-138. ACM, (2022)Sorting Short Keys in Circuits of Size o(n log n)., , and . SODA, page 2249-2268. SIAM, (2021)Prime Match: A Privacy-Preserving Inventory Matching System., , , , , , , , and . USENIX Security Symposium, page 6417-6434. USENIX Association, (2023)Efficient Perfectly Secure Computation with Optimal Resilience., , and . TCC (2), volume 13043 of Lecture Notes in Computer Science, page 66-96. Springer, (2021)