Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robbert de Haan

dblp:17/6201 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic protocols and secure computation · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.212015
A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations · IEEE Trans. Inf. Forensics Secur. 2015
Recommender systems › collaborative filtering
privacy-preserving collaborative filtering
0.212015
A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations · IEEE Trans. Inf. Forensics Secur. 2015
Cryptographic protocols and secure computation
secure outsourcing
0.212015
A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations · IEEE Trans. Inf. Forensics Secur. 2015
Cryptographic protocols and secure computation
secure multiparty computation
0.122015
Atomic Secure Multi-party Multiplication with Low Communication · EUROCRYPT 2007
A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations · IEEE Trans. Inf. Forensics Secur. 2015
Cryptographic protocols and secure computation › secret sharing
ramp secret sharing
0.112008
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves · EUROCRYPT 2008
Cryptographic protocols and secure computation
secret sharing
0.112008
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves · EUROCRYPT 2008
Cryptographic protocols and secure computation › secure arithmetic
secure multiplication
0.112007
Atomic Secure Multi-party Multiplication with Low Communication · EUROCRYPT 2007
Cryptographic protocols and secure computation › secure message transmission
perfectly secure message transmission
0.112006
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission · CRYPTO 2006
Cryptographic protocols and secure computation › secure computation protocols › round complexity of secure computation
two-round protocols
0.112006
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission · CRYPTO 2006

Methods — techniques the papers use, named apart from their topics

secret sharing · 0.1information-theoretic security · 0.1
YearPublicationVenuePosition
2015 A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations
abstract
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 shown to be provably secure in an adversarial model where one of the servers may arbitrarily deviate from the protocol specification, as well as employ an arbitrary number of dummy users. We use these techniques to implement a secure recommender system based on collaborative filtering that becomes more secure, and significantly more efficient than previously known implementations of such systems, when the preprocessing efforts are excluded. We suggest different alternatives for preprocessing, and discuss their merits and demerits.
Thijs Veugen, Robbert de Haan, Ronald Cramer, Frank Muller
IEEE Trans. Inf. Forensics Secur.2
2008 Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
Hao Chen 0095, Ronald Cramer, Robbert de Haan, Ignacio Cascudo
EUROCRYPT3
2007 Secure Computation from Random Error Correcting Codes
Hao Chen 0095, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan
EUROCRYPT4
2007 Atomic Secure Multi-party Multiplication with Low Communication
Ronald Cramer, Ivan Damgård, Robbert de Haan
EUROCRYPT3
2006 Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Ronald Cramer, Robbert de Haan
CRYPTO3