Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Nordholt, Peter Sebastian"'
Autor:
Romiti, Matteo, Victor, Friedhelm, Moreno-Sanchez, Pedro, Nordholt, Peter Sebastian, Haslhofer, Bernhard, Maffei, Matteo
Bitcoin (BTC) pseudonyms (layer 1) can effectively be deanonymized using heuristic clustering techniques. However, while performing transactions off-chain (layer 2) in the Lightning Network (LN) seems to enhance privacy, a systematic analysis of the
Externí odkaz:
http://arxiv.org/abs/2007.00764
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle
Externí odkaz:
http://arxiv.org/abs/1202.3052
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Nordholt, P S & Veeningen, M 2018, Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification . in Applied Cryptography and Network Security-16th International Conference, ACNS 2018, Proceedings . Lecture Notes in Computer Science, vol. 10892, pp. 321-339, Leuven, Belgium, 02/07/2018 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::bf81d7ca2fe6d5994dc2a150f610c431
https://pure.au.dk/portal/da/publications/minimising-communication-in-honestmajority-mpc-by-batchwise-multiplication-verification(3fb0131c-7236-4a94-8eb1-498b9c479ac5).html
https://pure.au.dk/portal/da/publications/minimising-communication-in-honestmajority-mpc-by-batchwise-multiplication-verification(3fb0131c-7236-4a94-8eb1-498b9c479ac5).html
Publikováno v:
Damgård, I, Damgård, K, Nielsen, K, Nordholt, P S & Toft, T 2017, Confidential benchmarking based on multiparty computation . in J Grossklags & B Preneel (eds), Financial Cryptography and Data Security-20th International Conference, FC 2016, Revised Selected Papers . vol. 9603 LNCS, Springer VS, Lecture Notes in Computer Science, vol. 9603, pp. 169-187, 20th International Conference on Financial Cryptography and Data Security, FC 2016, Christ Church, Barbados, 22/02/2016 . https://doi.org/10.1007/978-3-662-54970-4_10
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::5ce3302211a90b2b88c3dd01efc4ef05
https://pure.au.dk/portal/da/publications/confidential-benchmarking-based-on-multiparty-computation(626cee70-d578-4bd1-b65d-d53a9446048f).html
https://pure.au.dk/portal/da/publications/confidential-benchmarking-based-on-multiparty-computation(626cee70-d578-4bd1-b65d-d53a9446048f).html
Autor:
Nordholt, Peter Sebastian
Publikováno v:
Nordholt, P S 2013, New Approaches to Practical Secure Two-Party Computation . Institut for Datalogi, Aarhus Universitet .
We present two new approaches to maliciously secure two-party computationwith practical efficiency:• First, we present the first maliciously secure two-party computation protocolwith practical efficiency based on the classic semi-honest protocolgiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3e2ba079965c764d333411a01cfd603e
https://pure.au.dk/portal/da/publications/new-approaches-to-practical-secure-twoparty-computation(6429130a-a1e1-441c-840c-79185cf1ed8a).html
https://pure.au.dk/portal/da/publications/new-approaches-to-practical-secure-twoparty-computation(6429130a-a1e1-441c-840c-79185cf1ed8a).html
Autor:
Frederiksen, Tore Kasper, Jakobsen, Thomas Pelle, Nielsen, Jesper Buus, Nordholt, Peter Sebastian, Orlandi, Claudio
Publikováno v:
Frederiksen, T K, Jakobsen, T P, Nielsen, J B, Nordholt, P S & Orlandi, C 2013, MiniLEGO : Efficient secure two-party computation from general assumptions . in T Johansson & P Q Nguyen (eds), Advances in Cryptology – EUROCRYPT 2013 : 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings . Springer VS, Lecture Notes in Computer Science, vol. 7881, pp. 537-556, Internationall Conference on Theory and Application of Cryptographic Techniques, Athens, Greece, 26/05/2013 . https://doi.org/10.1007/978-3-642-38348-9_32
Frederiksen, T K, Jakobsen, T P, Nielsen, J B, Nordholt, P S & Orlandi, C 2013, MiniLEGO : Efficient secure two-party computation from general assumptions . in T Johansson & P Q Nguyen (eds), Advances in Cryptology – EUROCRYPT 2013 : 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings . Springer VS, Lecture Notes in Computer Science, vol. 7881, pp. 537-556, Athens, Greece, 26/05/2013 . https://doi.org/10.1007/978-3-642-38348-9_32
Frederiksen, T K, Jakobsen, T P, Nielsen, J B, Nordholt, P S & Orlandi, C 2013, MiniLEGO : Efficient secure two-party computation from general assumptions . in T Johansson & P Q Nguyen (eds), Advances in Cryptology – EUROCRYPT 2013 : 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings . Springer VS, Lecture Notes in Computer Science, vol. 7881, pp. 537-556, Athens, Greece, 26/05/2013 . https://doi.org/10.1007/978-3-642-38348-9_32
One of the main tools to construct secure two-party computation protocols are Yao garbled circuits. Using the cut-and-choose technique, one can get reasonably efficient Yao-based protocols with security against malicious adversaries. At TCC 2009, Nie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ce52821d88f00aff80a9963b8a0b419f
https://pure.au.dk/portal/da/publications/minilego(fd973d76-e3e8-411d-85ae-af5243552a89).html
https://pure.au.dk/portal/da/publications/minilego(fd973d76-e3e8-411d-85ae-af5243552a89).html
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Nielsen, J B, Nordholt, P S, Orlandi, C & Burra, S S 2011 ' A New Approach to Practical Active-Secure Two-Party Computation ' . < http://eprint.iacr.org/2011/091 >
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::617ae128ef940f86ae3aad80221ffbbc
https://pure.au.dk/portal/da/publications/a-new-approach-to-practical-activesecure-twoparty-computation(5d4f6960-1b32-4c1f-8523-a35fd2ac1e61).html
https://pure.au.dk/portal/da/publications/a-new-approach-to-practical-activesecure-twoparty-computation(5d4f6960-1b32-4c1f-8523-a35fd2ac1e61).html
Publikováno v:
Bendlin, R, Nielsen, J B, Nordholt, P S & Orlandi, C 2011, ' Lower and Upper Bounds for Deniable Public-Key Encryption ', Lecture Notes in Computer Science, vol. 7073, pp. 125-142 . https://doi.org/10.1007/978-3-642-25385-0_7
A deniable cryptosystem allows a sender and a receiver to communicate over an insecure channel in such a way that the communication is still secure even if the adversary can threaten the parties into revealing their internal states after the executio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::7e16b99e8e76aad2996d6aa6e540dc80
https://pure.au.dk/portal/da/publications/lower-and-upper-bounds-for-deniable-publickey-encryption(6b02831d-ac71-48b8-8efd-bf0b7f514ca4).html
https://pure.au.dk/portal/da/publications/lower-and-upper-bounds-for-deniable-publickey-encryption(6b02831d-ac71-48b8-8efd-bf0b7f514ca4).html