Richard Brinkman - Academia.edu (original) (raw)
Uploads
Papers by Richard Brinkman
... is shown in figure 5. Apart from the applet contexts one context for the JavaCard Runtime Env... more ... is shown in figure 5. Apart from the applet contexts one context for the JavaCard Runtime Environment ... The Java virtual machine exhibits access to objects not explicitly given as a parameter of a ... This means that each car has to stop, with reduction of traffic flow as a consequence ...
Proceedings of Workshop …, 2006
Most crypto systems rely on the computational complexity of breaking them. Historical evidence su... more Most crypto systems rely on the computational complexity of breaking them. Historical evidence suggests that all such systems in use nowadays will be broken some day, it is just a matter of time. Even though this time may be long, it may very well be possible that data remains sensitive for this very long time. In this paper we propose the principle of a lucky dip as a secure data store, which does not rely on the computational complexity. Before a message is put into the lucky dip it is compressed and split into multiple shares. All these shares are mixed with shares of the other messages already in the lucky dip. Due to the large amount of shares it is (1) infeasible to try all possible combinations (computational assumption) and (2) impossible, even with infinite computational power, to distinguish actual messages from recombined shares that looks genuine but which has never been inserted as such (information theoretic assumption).
... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000... more ... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000 875 Jerry 5600 Table 13.2. ... http://citeseer.nj.nec.com/song00practical.html. 8. R. Brinkman, L. Feng, JM Doumen, PH Hartel, and W. Jonker. Efficient tree search in encrypted data. ...
Proceedings of the 2008 Workshop on Middleware Security, 2008
Nowadays business applications closely collaborate with other business applications by sharing on... more Nowadays business applications closely collaborate with other business applications by sharing one or more services. Unfortunately, opening your business application to the outside world also sacrifices security. There is quite a number of standards that aims at protecting these services. However, most of these standards require special knowledge about security and are cumbersome to use. Our JASON 1 framework aims at simplifying the task of securing services. A programmer simply annotates his code with appropriate keywords and our tools will generate the security related code. The programmer can simply concentrate on the business application, while the JASON framework does the necessary cryptography.
Int J Chem React Eng, 2003
ABSTRACT
Proceedings of the Second Vdlb International Conference on Secure Data Management, 2005
To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypti... more To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypting the database is a better option. This paper describes a working prototype of an encrypted database system that allows remote querying over the encrypted data. Experiments with the system show the practical impact of our encoding scheme on storage space and CPU time. Two algorithms, each with two different matching rules, are compared to each other.
... It is represented as an array of b bits which are initially set to 0. In general the filter u... more ... It is represented as an array of b bits which are initially set to 0. In general the filter uses r independent hash functions ht, where ht : {0, 1}∗ → [1,b] for t ∈ [1,r], each of which maps a set element to one of the b array positions. ...
Http Dx Doi Org 10 1201 1086 44530 13 3 20040701 83065 3, Dec 21, 2006
... 2950 Jeroen Mathias Doumen (joint with Richard Brinkman, Wim Jonker) Searching in Encrypted D... more ... 2950 Jeroen Mathias Doumen (joint with Richard Brinkman, Wim Jonker) Searching in Encrypted Data . . . . . ... 2956 Daniel Panario (joint with Zhicheng (Jason) Gao) Degree distribution of the GCD of several univariate polynomials over finite fields . . . . . ...
Data-Centric Systems and Applications, 2007
... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000... more ... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000 875 Jerry 5600 Table 13.2. ... http://citeseer.nj.nec.com/song00practical.html. 8. R. Brinkman, L. Feng, JM Doumen, PH Hartel, and W. Jonker. Efficient tree search in encrypted data. ...
In this paper we describe the Secure Method Invocation (SMI) framework implemented for Jason, our... more In this paper we describe the Secure Method Invocation (SMI) framework implemented for Jason, our Javacard As Secure Objects Networks platform.
Proceedings of the 2008 workshop on Middleware security - MidSec '08, 2008
Nowadays business applications closely collaborate with other business applications by sharing on... more Nowadays business applications closely collaborate with other business applications by sharing one or more services. Unfortunately, opening your business application to the outside world also sacrifices security. There is quite a number of standards that aims at protecting these services. However, most of these standards require special knowledge about security and are cumbersome to use. Our JASON 1 framework aims at simplifying the task of securing services. A programmer simply annotates his code with appropriate keywords and our tools will generate the security related code. The programmer can simply concentrate on the business application, while the JASON framework does the necessary cryptography.
Lecture Notes in Computer Science, 2004
When outsourcing data to an untrusted database server, the data should be encrypted. When using t... more When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the server. In this paper we present a method, inspired by secure multi-party computation, to search efficiently in encrypted data. XML elements are translated to polynomials. A polynomial is split into two parts: a random polynomial for the client and the difference between the original polynomial and the client polynomial for the server. Since the client polynomials are generated by a random sequence generator only the seed has to be stored on the client. In a combined effort of both the server and the client a query can be evaluated without traversing the whole tree and without the server learning anything about the data or the query.
Lecture Notes in Computer Science, 2005
To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypti... more To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypting the database is a better option. This paper describes a working prototype of an encrypted database system that allows remote querying over the encrypted data. Experiments with the system show the practical impact of our encoding scheme on storage space and CPU time. Two algorithms, each with two different matching rules, are compared to each other.
Lecture Notes in Computer Science, 2011
... It is represented as an array of b bits which are initially set to 0. In general the filter u... more ... It is represented as an array of b bits which are initially set to 0. In general the filter uses r independent hash functions ht, where ht : {0, 1}∗ → [1,b] for t ∈ [1,r], each of which maps a set element to one of the b array positions. ...
... is shown in figure 5. Apart from the applet contexts one context for the JavaCard Runtime Env... more ... is shown in figure 5. Apart from the applet contexts one context for the JavaCard Runtime Environment ... The Java virtual machine exhibits access to objects not explicitly given as a parameter of a ... This means that each car has to stop, with reduction of traffic flow as a consequence ...
Proceedings of Workshop …, 2006
Most crypto systems rely on the computational complexity of breaking them. Historical evidence su... more Most crypto systems rely on the computational complexity of breaking them. Historical evidence suggests that all such systems in use nowadays will be broken some day, it is just a matter of time. Even though this time may be long, it may very well be possible that data remains sensitive for this very long time. In this paper we propose the principle of a lucky dip as a secure data store, which does not rely on the computational complexity. Before a message is put into the lucky dip it is compressed and split into multiple shares. All these shares are mixed with shares of the other messages already in the lucky dip. Due to the large amount of shares it is (1) infeasible to try all possible combinations (computational assumption) and (2) impossible, even with infinite computational power, to distinguish actual messages from recombined shares that looks genuine but which has never been inserted as such (information theoretic assumption).
... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000... more ... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000 875 Jerry 5600 Table 13.2. ... http://citeseer.nj.nec.com/song00practical.html. 8. R. Brinkman, L. Feng, JM Doumen, PH Hartel, and W. Jonker. Efficient tree search in encrypted data. ...
Proceedings of the 2008 Workshop on Middleware Security, 2008
Nowadays business applications closely collaborate with other business applications by sharing on... more Nowadays business applications closely collaborate with other business applications by sharing one or more services. Unfortunately, opening your business application to the outside world also sacrifices security. There is quite a number of standards that aims at protecting these services. However, most of these standards require special knowledge about security and are cumbersome to use. Our JASON 1 framework aims at simplifying the task of securing services. A programmer simply annotates his code with appropriate keywords and our tools will generate the security related code. The programmer can simply concentrate on the business application, while the JASON framework does the necessary cryptography.
Int J Chem React Eng, 2003
ABSTRACT
Proceedings of the Second Vdlb International Conference on Secure Data Management, 2005
To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypti... more To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypting the database is a better option. This paper describes a working prototype of an encrypted database system that allows remote querying over the encrypted data. Experiments with the system show the practical impact of our encoding scheme on storage space and CPU time. Two algorithms, each with two different matching rules, are compared to each other.
... It is represented as an array of b bits which are initially set to 0. In general the filter u... more ... It is represented as an array of b bits which are initially set to 0. In general the filter uses r independent hash functions ht, where ht : {0, 1}∗ → [1,b] for t ∈ [1,r], each of which maps a set element to one of the b array positions. ...
Http Dx Doi Org 10 1201 1086 44530 13 3 20040701 83065 3, Dec 21, 2006
... 2950 Jeroen Mathias Doumen (joint with Richard Brinkman, Wim Jonker) Searching in Encrypted D... more ... 2950 Jeroen Mathias Doumen (joint with Richard Brinkman, Wim Jonker) Searching in Encrypted Data . . . . . ... 2956 Daniel Panario (joint with Zhicheng (Jason) Gao) Degree distribution of the GCD of several univariate polynomials over finite fields . . . . . ...
Data-Centric Systems and Applications, 2007
... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000... more ... Table 13.1. Plain text salary table id name salary 23 Tom 70000 860 Mary 60000 320 John 50000 875 Jerry 5600 Table 13.2. ... http://citeseer.nj.nec.com/song00practical.html. 8. R. Brinkman, L. Feng, JM Doumen, PH Hartel, and W. Jonker. Efficient tree search in encrypted data. ...
In this paper we describe the Secure Method Invocation (SMI) framework implemented for Jason, our... more In this paper we describe the Secure Method Invocation (SMI) framework implemented for Jason, our Javacard As Secure Objects Networks platform.
Proceedings of the 2008 workshop on Middleware security - MidSec '08, 2008
Nowadays business applications closely collaborate with other business applications by sharing on... more Nowadays business applications closely collaborate with other business applications by sharing one or more services. Unfortunately, opening your business application to the outside world also sacrifices security. There is quite a number of standards that aims at protecting these services. However, most of these standards require special knowledge about security and are cumbersome to use. Our JASON 1 framework aims at simplifying the task of securing services. A programmer simply annotates his code with appropriate keywords and our tools will generate the security related code. The programmer can simply concentrate on the business application, while the JASON framework does the necessary cryptography.
Lecture Notes in Computer Science, 2004
When outsourcing data to an untrusted database server, the data should be encrypted. When using t... more When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the server. In this paper we present a method, inspired by secure multi-party computation, to search efficiently in encrypted data. XML elements are translated to polynomials. A polynomial is split into two parts: a random polynomial for the client and the difference between the original polynomial and the client polynomial for the server. Since the client polynomials are generated by a random sequence generator only the seed has to be stored on the client. In a combined effort of both the server and the client a query can be evaluated without traversing the whole tree and without the server learning anything about the data or the query.
Lecture Notes in Computer Science, 2005
To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypti... more To avoid insider attacks one cannot rely on access control to protect a database scheme. Encrypting the database is a better option. This paper describes a working prototype of an encrypted database system that allows remote querying over the encrypted data. Experiments with the system show the practical impact of our encoding scheme on storage space and CPU time. Two algorithms, each with two different matching rules, are compared to each other.
Lecture Notes in Computer Science, 2011
... It is represented as an array of b bits which are initially set to 0. In general the filter u... more ... It is represented as an array of b bits which are initially set to 0. In general the filter uses r independent hash functions ht, where ht : {0, 1}∗ → [1,b] for t ∈ [1,r], each of which maps a set element to one of the b array positions. ...