PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Scholl, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning.

, , , , , and . IEEE Symposium on Security and Privacy, page 1102-1120. IEEE, (2019)

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.

Julian Scholl University of Stuttgart

Elke Peter University of Stuttgart

Univ. -Prof. Dr. Rene Peters University of Stuttgart

Bernd Peters University of Stuttgart

Alexander Peter University of Stuttgart

 

Other publications of authors with the same name

Faster Secure Multi-party Computation of AES and DES Using Lookup Tables., , , , , and . ACNS, volume 10355 of Lecture Notes in Computer Science, page 229-249. Springer, (2017)Behavior Engineering with "Dual Dynamics" Models and Design Tools., , , , , , , , , and 2 other author(s). RoboCup, volume 1856 of Lecture Notes in Computer Science, page 231-242. Springer, (1999)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)Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection., , and . IACR Cryptology ePrint Archive, (2016)Description of the GMD RoboCup-99 Team., , , , , , , , , and 1 other author(s). RoboCup, volume 1856 of Lecture Notes in Computer Science, page 711-714. Springer, (1999)GMD-Robots., , , , , , , and . RoboCup, volume 2377 of Lecture Notes in Computer Science, page 648-652. Springer, (2001)Actively Secure OT Extension with Optimal Overhead., , and . CRYPTO (1), volume 9215 of Lecture Notes in Computer Science, page 724-741. Springer, (2015)MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer., , and . ACM Conference on Computer and Communications Security, page 830-842. ACM, (2016)Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs., , , , and . IACR Cryptol. ePrint Arch., (2022)Efficient protocols for oblivious linear function evaluation from ring-LWE., , , , and . J. Comput. Secur., 30 (1): 39-78 (2022)