University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Verification Across Intellectual Property Boundaries

Verification Across Intellectual Property Boundaries

Add to your list(s) Download to your calendar using vCal

  • UserHelmut Veith, Technische Universität München
  • ClockFriday 02 March 2007, 14:00-15:00
  • HouseFW11.

If you have a question about this talk, please contact Tom Ridge.

In many industries, the share of software components provided by third-party suppliers is steadily increasing. As the suppliers seek to secure their intellectual property (IP) rights, the customer usually has no direct access to the suppliers’ source code, and is able to enforce the use of verification tools, and other measures for enhancing software quality, only by legal requirements. In turn, the supplier has no means to convince the customer about successful verification without revealing the source code.

In this talk, we present a new approach to resolve the conflict between the IP interests of the supplier and the quality interests of the customer. We introduce a protocol in which a dedicated server (called the ``amanat’‘) is controlled by both parties: the customer controls the verification task performed by the amanat, while the supplier controls the communication channels of the amanat to ensure that the amanat does not leak information about the source code.

We argue that the protocol is both practically useful and mathematically sound. As the protocol is based on well-known (and relatively lightweight) cryptographic primitives, it allows a straightforward implementation on top of existing verification tool chains. To substantiate our security claims, we establish the correctness of the protocol by cryptographic reduction proofs.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity