• Corpus ID: 232075702

Secure Evaluation of Knowledge Graph Merging Gain

  title={Secure Evaluation of Knowledge Graph Merging Gain},
  author={Leandro Eichenberger and Michael Cochez and Benjamin Heitmann and Stefan Decker},
Finding out the differences and commonalities between the knowledge of two parties is an important task. Such a comparison becomes necessary, when one party wants to determine how much it is worth to acquire the knowledge of the second party, or similarly when two parties try to determine, whether a collaboration could be beneficial. When these two parties cannot trust each other (for example, due to them being competitors) performing such a comparison is challenging as neither of them would be… 

Figures and Tables from this paper


Efficient Private Matching and Set Intersection
This work considers the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain, and presents protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments.
Security of Blind Signatures Revisited
This work revisits the security definitions of blind signatures and proposes a stronger notion, called honest-user unforgeability, that covers these attacks and gives a simple and efficient transformation that turns any unforgeable blind signature scheme (with deterministic verification) into an honest- user unforgeables one.
Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries
Two-round k-out-of-n oblivious transfer schemes, in which R sends O(k) messages to S, and S sends O (n) messages back to R, which are the most efficient ones in terms of the communication cost, in both rounds and the number of messages.
Efficient 1-Out-n Oblivious Transfer Schemes
In this paper we propose an efficient (string) OTn1 scheme for any n ? 2. We build our OTn1 scheme from fundamental cryptographic techniques directly. It achieves optimal efficiency in terms of the
Quantifying Information Leaks in Outbound Web Traffic
Measure algorithms for the Hypertext Transfer Protocol (HTTP), the main protocol for web browsing, are presented and it is shown that the algorithms were able to discount 98.5% of measured bytes and effectively isolate information leaks.
Efficient Robust Private Set Intersection
The first solution to this problem of ensuring robustness, namely, coping with potentially arbitrarily misbehaving parties, while retaining protocol efficiency (rather than employing costly generic techniques) is presented.
A randomized protocol for signing contracts
Randomized protocols for signing contracts, certified mail, and flipping a coin are presented and an implementation of the 1-out-of-2 oblivious transfer, using any public key cryptosystem, is presented.
How To Exchange Secrets with Oblivious Transfer
  • M. Rabin
  • Computer Science
    IACR Cryptol. ePrint Arch.
  • 2005
As this paper puts forward the notion of “Oblivious Transfers” and is a well-known and frequently cited paper, I felt I should typeset the manuscript, and here is the result. While typesetting, I
Automatic Discovery and Quantification of Information Leaks
This work presents the first automatic method for information-flow analysis that discovers what information is leaked and computes its comprehensive quantitative interpretation, which includes all established information-theoretic measures in quantitative information- flow.
Space/time trade-offs in hash coding with allowable errors
Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.