PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kraschewski, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Social key exchange network - from ad-hoc key exchange to a dense key network.

, , , , and . GI-Jahrestagung, volume P-192 of LNI, page 350. GI, (2011)

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.

Daniel Kempf University of Stuttgart

GALÆXI Application: NASA Rotor 37, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.
GALÆXI Application: NASA Rotor 37, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI Verification: Convergence Tests, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI Validation: Taylor-Green Vortex, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.

Daniel Marino

Daniel Roth

Daniel Roth

Daniel Roth

 

Other publications of authors with the same name

On Definitions of Selective Opening Security., , and . Public Key Cryptography, volume 7293 of Lecture Notes in Computer Science, page 522-539. Springer, (2012)Reusable Non-Interactive Secure Computation., , , , , , and . CRYPTO (3), volume 11694 of Lecture Notes in Computer Science, page 462-488. Springer, (2019)Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (full version)., and . IACR Cryptology ePrint Archive, (2010)General Statistically Secure Computation with Bounded-Resettable Hardware Tokens., , , and . TCC (1), volume 9014 of Lecture Notes in Computer Science, page 319-344. Springer, (2015)David & Goliath Oblivious Affine Function Evaluation - Asymptotically Optimal Building Blocks for Universally Composable Two-Party Computation from a Single Untrusted Stateful Tamper-Proof Hardware Token., , and . IACR Cryptology ePrint Archive, (2012)On definitions of selective opening security., , and . IACR Cryptology ePrint Archive, (2011)Social key exchange network - from ad-hoc key exchange to a dense key network., , , , and . GI-Jahrestagung, volume P-192 of LNI, page 350. GI, (2011)Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions., and . TCC, volume 6597 of Lecture Notes in Computer Science, page 364-381. Springer, (2011)Reusable Non-Interactive Secure Computation., , , , , , and . IACR Cryptology ePrint Archive, (2018)Efficient Reductions for Non-signaling Cryptographic Primitives., , and . ICITS, volume 6673 of Lecture Notes in Computer Science, page 120-137. Springer, (2011)