Dan Cvrcek

I am a founder of Enigma Bridge – a Cambridge-based start-up company that has developed a unique technology for cloud encryption. It uses secure hardware and offers its customers physical separation from each other while using our cloud service.

I am a cryptography architect and engineer. I have spent several years analysing security and crypto architectures of large banking information systems and looking at operational processes and procedures (Swift, card payment processing, Faster Payments, IBM and Cryptomathic key management systems).

Three years at the University of Cambridge and more than ten years of academic experience. Expert on information security and applied cryptography, IT system architectures, down to embedded system development. Practical experience with software and hardware products (smart cards, hardware security modules, COTS systems) and implementations – design, testing, attacking and defence designs.

Specialities: Cryptography in banking systems, security of wireless networks, security of smart cards, public key infrastructures, key management, password security.

 

Some of papers nad talks from my previous life

    • Fighting the ‘Good’ Internet War
      The paper reviews current strategies to counter Internet threats in the light of the classic strategy literature. It often advocates proactive action, and dominance of the (virtual, in our case) battlefield, which is the opposite from what we see defenders to deploy today. Their actions are instead reactive and exclusively defensive. We propose strategies for defenders to regain the initiative and push security solutions far beyond the reach of current security tools. Yet those strategies start mirroring actions and technologies of the bad guys, and confront us with important technical,legal and moral dilemmas.
      Security Protocols Workshop, Cambridge, UK, May 2008 [ paper (PDF 90K) ]
    • Alternative Security for WiFi Networks
      This is a presentation for a talk I gave in March 2007 at the Computer Lab. The talk overviewed design and implementation of a reputation system (let’s call it this way) in WiFi networks. The implementation is collecting data from a real network with about 250 users.
      Talk given at the Computer Lab in March 2007 [ slides (PDF 1200K) ]
    • Contextual Information for Security and Privacy[ (text w/o papers (PDF 531K)]

Dan Cvrcek – habilitation thesis

      From the abstract: The very same mechanisms underpinning the power of on-line services can also be used (sometimes without user’s knowledge or consent) to collect sensitive information about an individual or his/her behaviour. Powerful data collection techniques, user’s inability to find out what is being collected nor how to stop it, combined with press and TV exposures of revealed “bad actors” in privacy, have resulted in ever increasing lack of trust among on-line Internet users. Recent studies showed vigilance of Internet banking users and e.g. changes in their behaviour to decrease risks of online fraud.

When we turn the table we will find out the other side of the game that is becoming important in mobile and ubiquitous computing. There is a strong research effort in the areas of large distributed systems, ubiquitous computing, and peer-to-peer networks with the main goal to make communication and computation as effective as possible. To reach this goal, we need substantial amount of information about system components as well as about users. Of course, it is a clear threat unquestionably deteriorating privacy of users beyond today’s reality. Shortly, the surge in ubiquitous computing is bringing in new security challenges.

  • A Study on The Value of Location Privacy
    Dan Cvrcek, Marek Kumpost, Vashek Matyas, George Danezis
    The paper introduces results of a study into the value of location privacy for individuals using mobile devices. We questioned a sample of over 1200 people from five EU countries, and used tools from experimental psychology and economics to extract from them the value they attach to their location data. We compare this value acress national groups, gender and technical awareness, but also the perceived difference between academic use and commercial exploitation. We provide some analysis of the self-selection bias of such a study, and look further at the valuation of location data over time using data from another experiment.
    Workshop on Privacy in the Electronic Society, Alexandria, USA, 2006 [ paper (PDF 266K) | slides (PDF 320K)]
  • Key Distribution Protocols for WSN (probabilistic security)
    Dan Cvrcek, Petr Svenda
    Wireless sensor networks represent an interesting environment for a number of problems related to distributed systems. They have got specific restrictions (power consumption), unusual routing requirements (nodes/motes have no idea about the network topology when deployed), and the information produced by nodes gains value when aggregated, a space for new security protocols exist.

    We have put some effort into simulating security of key agreement protocols against an attacker controlling only a fraction of the network (key infection, secrecy amplification). The talk will briefly survey several existing key management schemes and highlight some interesting results we have obtained for key infection protocols.
    A talk given at the Computer Lab in April 2005 [ slides (PPT 1.51M) ]

  • Unwrapping the Chrysalis
    Mike Bond, Daniel Cvrcek, Steven J.Murdoch
    We describe our experiences reverse engineering the Chrysalis-ITS Luna CA3 a PKCS#11 compliant cryptographic token. Emissions analysis and security API attacks are viewed by many to be simpler and more efficient than a direct attack on an HSM. But how difficult is it to actually “go in the front door”? We describe how we unpicked the CA? internal architecture and abused its low-level API to impersonate a CA? token in its cloning protocol ? and extract PKCS#11 private keys in the clear. We quantify the effort involved in developing and applying the skills necessary for such a reverse-engineering attack. In the process, we discover that the Luna CA? has far more undocumented code and functionality than is revealed to the end-user.
    Technical Report UCAM-CL-TR-592, University of Cambridge, Computer Laboratory, June 2004. [ paper (PDF 344K) | source code (85K) ]
  • Pseudonymity in the light of evidence-based trust
    Daniel Cvrcek, Vashek Matyas
    This position paper discusses the relation of privacy, namely pseudonymity, to evidence-based trust (or rather reputation). Critical concepts of evidence-based trust/reputation systems are outlined first, followed by an introduction to the four families of the Common Criteria (for security evaluation) Privacy Class: Unobservability, Anonymity, Unlinkability, and Pseudonymity. The paper then discusses the common problem of many papers that narrow the considerations of privacy to anonymity only, and elaborates on the concept of pseudonymity through aspects of evidence storing, attacks and some of their implications, together with other related issues like use of mixes.
    Security Protocols Workshop, Cambridge, UK, 23-25 May 2004. [ paper (PDF 102kB) ]
  • Privacy – what do you mean?
    Daniel Cvrcek, Vashek Matyas
    The paper reviews several models of privacy with the main focus toward unlinkability. The Common Criteria defintions are scrutinized and uncovered definitions of unlinkability are identified. Properties of one model covering a problem of context information – the Freiburg Privacy Diamond – are also discussed.
    Ubicomp Privacy Workshop, Nottingham, UK, 7 September, 2004.
  • Dynamics of Reputation
    Daniel Cvrcek
    To enforce security without user enrollment, trust/reputation systems were proposed to use experience as crucial information for cooperation as well as security enforcement mechanisms. However, use of trust brings in very hard-to-solve problems that still distract many people from exploitation of trust for security mechanisms. Its ability to change and react to changes in environment and user behaviour is profound for usability of mechanisms built on top of it. Dempster-Shafer theory was proposed as a suitable theoretical model for trust computation. Here, we define general requirements for reputation dynamics and demonstrate that Dempster-Shafer theory properties are not as good as is widely thought. On the other side, simple formulae work.
    NordSec 2004, Helsinki, Finland, proceedings, pp. 1-7, 4-5 November 2004. [ paper (PDF 215K) ]
  • On the role of contectual information for privacy attacks and classification
    Daniel Cvrcek, Vashek Matyas
    Many papers and articles attempt to define or even quantify privacy, typically with a major focus on anonymity. A related research exercise in the area of evidence-based trust models for ubiquitous computing environments has given us an impulse to take a closer look at the definition(s) of privacy in the Common Criteria, which we then transcribed in a more formal manner. This lead us to a further review of unlinkability, and revision of another semi-formal model allowing for expression of anonymity and unlinkability — the Freiburg Privacy Diamond. We propose new means of describing (obviously only observable) characteristics of a system to reflect the role of contexts for profiling — and linking — users with actions in a system. We believe this approach should allow for evaluating privacy in large data sets.
    Privacy and Security Aspects of Data Mining workshop, IEEE ICDM, Brighton, UK, 1 November 2004. [ paper (PDF 183 kB) ]
  • Evidence processing and privacy issues in evidence-based reputation systems
    Daniel Cvrcek, Vashek Matyas
    The novel idea of evidence-based reputation (or trust) systems is that such systems do not rely on an objective knowledge of user identity. One has instead to consider possible privacy infringements based on the use of data (evidence) about the previous behaviour of entities in the systems. We elaborate on the concept of pseudonymity through aspects of evidence storing and processing.
    Journal of Computer Standards & Interfaces, Elsevier, pp 533-545, Vol 27, Issue 5 (June 2005)