( en | de | ru )

 

Disambiguation of "Nielsen, Jesper Buus"

Author of the publication

copydeleteadd this publication to your clipboard
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor.

, and . IACR Cryptology ePrint Archive, (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.

Jesper Tang Nielsen

Monika Buus

Jesper Dieckmann

Zur (Psycho-)Pharmakologie halluzinogener Tryptamin-Derivate: eine Literaturübersicht mit besonderer Berücksichtigung der Schizophrenieforschung. MedH Hannover, (2009)

Claudia Constanze Buus

Jesper Hansen

 

Other publications of authors with the same name

A Framework for Outsourcing of Secure Computation., , and . CCSW, page 81-92. ACM, (2014)Random-index PIR with Applications to Large-Scale Secure MPC., , , , and . IACR Cryptol. ePrint Arch., (2020)Superposition Attacks on Cryptographic Protocols, , , and . CoRR, (2011)Cross&Clean: Amortized Garbled Circuits with Constant Overhead., and . IACR Cryptology ePrint Archive, (2016)Universally Composable Zero-Knowledge Proof of Membership.. IACR Cryptology ePrint Archive, (2017)TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation., , , and . IACR Cryptology ePrint Archive, (2015)On the Communication required for Unconditionally Secure Multiplication., , and . IACR Cryptology ePrint Archive, (2015)The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited., , , and . CRYPTO (1), volume 10401 of Lecture Notes in Computer Science, page 167-187. Springer, (2017)Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor., and . CRYPTO, volume 2442 of Lecture Notes in Computer Science, page 581-596. Springer, (2002)Robust Multiparty Computation with Linear Communication Complexity., and . CRYPTO, volume 4117 of Lecture Notes in Computer Science, page 463-482. Springer, (2006)