Výsledky vyhledávání - "Robbert de Haan"

A framework for secure computations with two non-colluding servers and multiple clients, applied to recommendations

Autor: Ronald Cramer, Frank Müller, Robbert de Haan, Thijs Veugen

Publikováno v: IEEE Transactions on Information Forensics and Security, 3, 10, 445-457

We provide a generic framework that, with the help of a preprocessing phase that is independent of the inputs of the users, allows an arbitrary number of users to securely outsource a computation to two non-colluding external servers. Our approach is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e19c7b073b1516dc8a95c8dc971378ad
http://resolver.tudelft.nl/uuid:c9c2e7b3-e1c7-439c-a401-33bc71624ca1

Zobrazit plný text záznamu

Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves

Autor: Robbert de Haan, Ronald Cramer, Hao Chen, Ignacio Cascudo Pueyo

Publikováno v: Advances in Cryptology – EUROCRYPT 2008 ISBN: 9783540789666
EUROCRYPT

In this work we introduce a novel paradigm for the construction of ramp schemes with strong multiplication that allows the secret to be chosen in an extension field, whereas the shares lie in a base field. When applied to the setting of Shamir's sche

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e17dca7b2bb6c910252b15cecb733f16
https://doi.org/10.1007/978-3-540-78967-3_26

Zobrazit plný text záznamu

Secure Computation from Random Error Correcting Codes

Autor: Vinod Vaikuntanathan, Shafi Goldwasser, Robbert de Haan, Ronald Cramer, Hao Chen

Publikováno v: Advances in Cryptology-EUROCRYPT 2007 ISBN: 9783540725398
EUROCRYPT

Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure computation is that security is maintained even in the presence of an adversary wh

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae0c06efd36b1202fd8bb7cb4c4a4be3
https://ir.cwi.nl/pub/12070

Zobrazit plný text záznamu

Atomic Secure Multi-party Multiplication with Low Communication

Autor: Ivan Damgård, Robbert de Haan, Ronald Cramer

Publikováno v: Damgård, I B, Cramer, R & de Haan, R 2007, Atomic Secure Multi-party Multiplication with Low Communication . in M Naor (ed.), Advances in Cryptology-EUROCRYPT 2007 : 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007. Proceedings . Springer, Lecture Notes in Computer Science, vol. 4515, pp. 329-346, Barcelona, Spain, 20/05/2007 . https://doi.org/10.1007/978-3-540-72540-4_19
Advances in Cryptology-EUROCRYPT 2007 ISBN: 9783540725398
EUROCRYPT

We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir's secret sharing scheme and it can be viewed as a practical variation on one of the central techniques in the foundational results o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49b9a291715a5b1868f64db0444f2f60
https://pure.au.dk/portal/da/publications/atomic-secure-multiparty-multiplication-with-low-communication(94134eb0-e37e-11dc-9afb-000ea68e967b).html

Zobrazit plný text záznamu

Asymptotically Optimal Two-Round Perfectly Secure Message Transmission

Autor: Ronald Cramer, Robbert de Haan, Saurabh Agarwal

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540374329
CRYPTO

The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (${\mathcal{S}}$) and receiver (${\mathcal{R}}$) that are connected by a synchronous network of n≥2t+1 noiseless 2-way communication channel

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4056e0730c500fc11132b174e377074f
https://doi.org/10.1007/11818175_24

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání