weixun lin

Displaying 1-9 of 9 results

  • White Papers // Nov 2012

    Practical Polynomial Time Known Plaintext Attacks on a Stream Cipher Proposed by John Nash

    In this paper, the authors present two known plaintext attacks on a stream cipher which was developed by John Nash in the early 1950's but whose design was declassified by the NSA only in 2012. This attack succeeds with high probability for randomly chosen keys even when the only thing...

    Provided By weixun lin

  • White Papers // Oct 2012

    Quantitative Analysis of the Full Bitcoin Transaction Graph

    The Bitcoin scheme is a rare example of a large scale global payment system in which all the transactions are publicly accessible (but in an anonymous way). The authors downloaded the full history of this scheme, and analyzed many statistical properties of its associated transaction graph. In this paper, they...

    Provided By weixun lin

  • White Papers // Jan 2011

    Homomorphic Encryption: From Private-Key to Public-Key

    The authors show how to transform any additively homomorphic private-key encryption scheme that is compact, into a public-key encryption scheme. By compact they mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. They do not require anything else...

    Provided By weixun lin

  • White Papers // May 2010

    Securing Computation Against Continuous Leakage

    The authors present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded number of executions. Their method uses as a building block a semantically secure subsidiary bit encryption scheme with the following additional operations:...

    Provided By weixun lin

  • White Papers // May 2010

    Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability

    The \"Classical\" definition of semantic secure public-key encryption by the researchers, requires that an efficient attacker with access to the public encryption-key must not be able to find two messages such that it can distinguish a random encryption of one from a random encryption of the other. Numerous candidate public-key...

    Provided By weixun lin

  • White Papers // Apr 2010

    Another Look at Complementation Properties

    In this paper the authors present a collection of attacks based on generalizations of the complementation property of DES. They find symmetry relations in the key schedule and in the actual rounds, and they use these symmetries to build distinguishers for any number of rounds when the relation is deterministic....

    Provided By weixun lin

  • White Papers // Jun 2009

    Public-Key Cryptosystems Resilient to Key Leakage

    Most of the work, in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various forms of unintended information leakage, which is inherent to almost all physical implementations. Inspired by recent side-channel attacks, especially the \"Cold boot attacks\", The...

    Provided By weixun lin

  • White Papers // Dec 2008

    Chosen-Ciphertext Security via Correlated Products

    The authors initiate the study of one-wayness under correlated products. The main motivation of this study is the construction of public-key encryption schemes that are secure against Chosen Ciphertext Attacks (CCA). They show that any collection of injective trapdoor functions that is secure under a very natural correlated product can...

    Provided By weixun lin

  • White Papers // Apr 2008

    SQUASH - A New MAC with Provable Security Properties for Highly Constrained Devices Such As RFID Tags

    The authors describe a new function called SQUASH (which is short for SQUare-hASH), which is ideally suited to challenge-response MAC applications in highly constrained devices such as RFID tags. It is exceptionally simple, requires no source of random bits, and can be efficiently implemented on processors with arbitrary word sizes....

    Provided By weixun lin

  • White Papers // Oct 2012

    Quantitative Analysis of the Full Bitcoin Transaction Graph

    The Bitcoin scheme is a rare example of a large scale global payment system in which all the transactions are publicly accessible (but in an anonymous way). The authors downloaded the full history of this scheme, and analyzed many statistical properties of its associated transaction graph. In this paper, they...

    Provided By weixun lin

  • White Papers // Nov 2012

    Practical Polynomial Time Known Plaintext Attacks on a Stream Cipher Proposed by John Nash

    In this paper, the authors present two known plaintext attacks on a stream cipher which was developed by John Nash in the early 1950's but whose design was declassified by the NSA only in 2012. This attack succeeds with high probability for randomly chosen keys even when the only thing...

    Provided By weixun lin

  • White Papers // Apr 2008

    SQUASH - A New MAC with Provable Security Properties for Highly Constrained Devices Such As RFID Tags

    The authors describe a new function called SQUASH (which is short for SQUare-hASH), which is ideally suited to challenge-response MAC applications in highly constrained devices such as RFID tags. It is exceptionally simple, requires no source of random bits, and can be efficiently implemented on processors with arbitrary word sizes....

    Provided By weixun lin

  • White Papers // Apr 2010

    Another Look at Complementation Properties

    In this paper the authors present a collection of attacks based on generalizations of the complementation property of DES. They find symmetry relations in the key schedule and in the actual rounds, and they use these symmetries to build distinguishers for any number of rounds when the relation is deterministic....

    Provided By weixun lin

  • White Papers // Jun 2009

    Public-Key Cryptosystems Resilient to Key Leakage

    Most of the work, in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various forms of unintended information leakage, which is inherent to almost all physical implementations. Inspired by recent side-channel attacks, especially the \"Cold boot attacks\", The...

    Provided By weixun lin

  • White Papers // Dec 2008

    Chosen-Ciphertext Security via Correlated Products

    The authors initiate the study of one-wayness under correlated products. The main motivation of this study is the construction of public-key encryption schemes that are secure against Chosen Ciphertext Attacks (CCA). They show that any collection of injective trapdoor functions that is secure under a very natural correlated product can...

    Provided By weixun lin

  • White Papers // May 2010

    Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability

    The \"Classical\" definition of semantic secure public-key encryption by the researchers, requires that an efficient attacker with access to the public encryption-key must not be able to find two messages such that it can distinguish a random encryption of one from a random encryption of the other. Numerous candidate public-key...

    Provided By weixun lin

  • White Papers // May 2010

    Securing Computation Against Continuous Leakage

    The authors present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded number of executions. Their method uses as a building block a semantically secure subsidiary bit encryption scheme with the following additional operations:...

    Provided By weixun lin

  • White Papers // Jan 2011

    Homomorphic Encryption: From Private-Key to Public-Key

    The authors show how to transform any additively homomorphic private-key encryption scheme that is compact, into a public-key encryption scheme. By compact they mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. They do not require anything else...

    Provided By weixun lin