论文信息 - Oblivious TLS via Multi-Party Computation - 字舞流文

Oblivious TLS via Multi-Party Computation

Ivan Damgård | Peter Scholl | Sven Trieflinger | Damiano Abram

[1] Ivan Damgård,et al. Confidential Benchmarking Based on Multiparty Computation , 2016, Financial Cryptography.

[2] Marcel Keller,et al. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits , 2013, ESORICS.

[3] Peter Scholl,et al. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer , 2017, Journal of Cryptology.

[4] Hugo Krawczyk,et al. Cryptographic Extraction and Key Derivation: The HKDF Scheme , 2010, IACR Cryptol. ePrint Arch..

[5] Yehuda Lindell,et al. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority , 2017, IACR Cryptol. ePrint Arch..

[6] Daniel J. Bernstein,et al. Curve25519: New Diffie-Hellman Speed Records , 2006, Public Key Cryptography.

[7] Marcel Keller,et al. Securing DNSSEC Keys via Threshold ECDSA from Generic MPC , 2020, ESORICS.

[8] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..

[9] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..

[10] Marcel Keller,et al. Faster Secure Multi-party Computation of AES and DES Using Lookup Tables , 2017, ACNS.

[11] Ivan Damgård,et al. Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..