@article{Authentication protocol,
  abstract = "Journal of Information and Computation. Vol. 206, Issues 2-4, Feb-Apr 2008, pp. 250-271. Special Issue of Information and Computation on Computer Security: Foundations and Automated Reasoning. Accepted in 20th July 2007, appear online in November 2007. <a href="http://web.comlab.ox.ac.uk:8180/booster/app/1239417/paper.pdf">Paper(PDF)</a> ",
  author = "Long H. Nguyen and Andrew W. Roscoe",
  booktitle = "Special Issue of Information and Computation on Computer Security: Foundations and Automated Reasoning",
  journal = "{Journal of Information and Computation}",
  pages = "250-271",
  publisher = "Elsiver",
  title = "Authenticating ad hoc networks by comparison of short digests",
  url = "http://www.sciencedirect.com/science?_ob=PublicationURL&_tockey=%23TOC%236825%232008%23997939997%23682671%23FLP%23&_cdi=6825&_pubType=J&_auth=y&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=9b49cd2cbea63e35fe8ac57af7610d4f",
  volume = "206, Issues 2-4",
  year = "Feb-Apr 2008",
}


    
      @misc{Bound for universal hash,
  abstract = "Using the pigeon-hole principle, we introduce a new lower bound for the key length in an almost universal hash function, which is tighter than another similar bound derived from a well-studied equivalence between almost universal hashes and error-correcting codes. The new bound turns out to be tighter than another similar bound derived from the equivalence between almost universal functions and error-correcting codes (i.e. the Singleton bound). To the best of my knowledge, this is the first time the equivalence is shown not to produce a tight bound for an almost universal hash functions. This result, perhaps paradoxically, does not imply that we can further improve the Singleton bound in coding theory, and I will explain why there is a mismatch in this talk.",
  author = "Long H. Nguyen and Andrew W. Roscoe",
  journal = "Presented at the Summer School on Proable Security 2009",
  title = "New bound for almost universal hash funcions",
  url = "http://www.comlab.ox.ac.uk/files/749/uhf.pdf",
  year = "2009",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'institution' field 
@techreport{EPSRC,
  author = "Long Nguyen",
  title = "Case study",
  year = "2009",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'school' field
@phdthesis{Thesis,
  abstract = "The popularity of personal computing devices (e.g. smart cards) exposes users to risks, notably identity theft, and creates new requirements for secure communication. A new approach to creating secure communication is to use human trust and human interactions. Thus they potentially eliminate the need for passwords as in Bluetooth, shared secrets or trusted parties, which are too complex and expensive to use in portable devices. In the new technology, handheld devices exchange data (e.g. payment, heart rates or public keys) over some medium (e.g. WiFi) and then display a short digest of the protocol's run that the devices' human owners manually compare to ensure they agree on the data, i.e. the latter uses human interactions to prevent identity theft. In this thesis, we present several new protocols of the type to optimise the work required of humans to achieve a given level of security. We discover that the design of these protocols is influenced by several principles, including the ideas of commitment without knowledge and separation of security concerns where random and cryptographic attacks should be tackled separately. Underpinning the technology is a new cryptographic function, termed keyed digest, which produces a short number for humans to compare. This is similar to universal hashes, but its output length is shorter (e.g. 16 bits). Hence, it should be faster to compute. We propose several digest constructions using Toeplitz matrices, integer multiplication and random numbers. The application of digests leads us to develop more efficient alternatives to standard digital signatures. Our protocol security analysis leads to a new bound on the key length for universal hashes, derived by combinatorial analysis. In comparing this with other well-studied bounds, we discover a crucial value of a security parameter which represents an important threshold in the behaviour of the bounds, i.e. quantifying the Wegman-Carter effect.",
  author = "Long Hoang Nguyen",
  journal = "PhD Thesis",
  title = "Authentication protocols in pervasive computing",
  year = "2009",
}


    
      @proceedings{Seperation of security concerns,
  author = "Long Hoang Nguyen and Andrew William Roscoe",
  booktitle = "FCS-ARSPA-WITS'08",
  journal = "In proceedings of FCS-ARSPA-WITS'08 workshop",
  title = "Separating two roles of hashing in one-way message authentication",
  year = "2008, In Proceedings of FCS-ARSPA-WITS'08 workshop (Foundation of Computer Security, Automated Reasoning Security Protocol Analysis and Issues in the Theory of Security)",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'booktitle' field 
@incollection{ISO,
  author = "Editor: Nguyen Hoang Long",
  title = "ISO/IEC 9798-6: Information technology -- Security techniques -- Entity authentication -- Part 6: Mechanisms using manual data transfer",
  year = "2008",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'booktitle' 
@conference{universal hash,
  abstract = "We introduce a new lower bound on the key length, termed the "combinatorial" bound, in an \epsilon-almost universal family of hash functions. This result gives us a lower bound on the bit-length of the hash key r with respect to the message bit-length K, the hash output bit-length b, and the hash collision probability \epsilon. We derive the bound using combinatorial analysis, and also show how it corresponds to bounds for subsets of parameter values derived from the theory of error-correcting codes, and finite field arithmetic. We compare the bound against other well-known bounds of this and other universal families of hash functions. We discover that the value \epsilon = [ 1 + b/(K-b) ] 2^{-b} represents an important "threshold" in the behaviour of bounds, quantifying the "Wegman-Carter" effect. We then move on to analyse how tightly our new bound is satisfied by many known ways of computing universal families of hash functions, including error-correcting codes, polynomial hashing over finite fields, and square hash with small key size. In addition to the combinatorial bound, a new lower bound on the key length of an almost XOR universal family of hash function is introduced.",
  author = "Long H. Nguyen and Andrew W. Roscoe",
  journal = "To be submitted",
  title = "New combinatorial bounds for universal families of hash functions",
  year = "2008",
}


    
      @article{Survey paper,
  abstract = "Submitted to Journal of Computer Security",
  author = "Long Hoang Nguyen and Andrew William Roscoe",
  journal = "Submitted to Journal of Computer Security",
  title = "Authentication protocols based on low-bandwidth unspoofable channels: a comparative survey",
  year = "2008",
}


    
      @misc{Patent,
  abstract = "Publication Number: WO/2007/052045. International Application No.: PCT/GB2006/004113. Publication Date: 10.05.2007.",
  author = "Andrew W. Roscoe and Long H. Nguyen",
  journal = "International Patent, published by the World Intellectual Property Organization (WIPO)",
  organization = "the World Intellectual Property Organization (WIPO)",
  title = "SECURITY IN COMPUTING NETWORKS",
  url = "http://www.wipo.int/pctdb/en/wo.jsp?wo=2007052045&IA=WO2007052045&DISPLAY=STATUS",
  year = "2006, International Patent, publishd by the World Intellectual Property Organization (WIPO)",
}


    
      @misc{International Patent Application,
  abstract = "International Patent Application No. PCT/GB07/004963, published by the World Intellectual Property Organization (WIPO), publication number: WO/2008/078101, publication date: 03.07.2008.",
  author = "A.W. Roscoe, B. Chen, L.H. Nguyen",
  journal = "International Patent Application No. PCT/GB07/004963.",
  publisher = "the World Intellectual Property Organization (WIPO)",
  title = "Improvements in communications security",
  url = "http://www.wipo.int/pctdb/en/wo.jsp?WO=2008078101&IA=GB2007004963&DISPLAY=STATUS",
  year = "2006, International Patent Application",
}


    
      @techreport{RR-06-01,
  abstract = "In this paper, a new threshold signature scheme for RSA is proposed. The scheme does not require a trusted third party and no secure information is leaked throughout the protocol. The time and storage complexity of the protocol is linear in the number of parties and no restriction is placed on the RSA modulus. Combined with the $n$-out-of-$n$ key generation protocol of Boneh and Franklin, one has a complete solution for the $k$-out-of-$n$ threshold RSA problem with no trusted dealer.",
  author = "Long Hoang Nguyen",
  institution = "Oxford University Computing Laboratory",
  month = "March",
  number = "RR-06-01",
  title = "Partially Interactive Threshold RSA Signatures",
  year = "2006",
}


    
      @inproceedings{ARSPA,
  abstract = "<p>Proceedings of FCS-ARSPA August 2006</p><p><em><a href="http://web.comlab.ox.ac.uk:8180/publications/files/rnprots.pdf&lt;/A&gt;">PDF.</a> </em></p>",
  author = "Long H. Nguyen and Andrew W. Roscoe",
  booktitle = "{Proceedings of FCS-ARSPA 2006 (Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis)}",
  title = "Efficient group authentication protocol based on human interaction",
  url = "http://www.easychair.org/FLoC-06/FCS-ARSPA-day226.html",
  year = "2006",
}


    
      @misc{RSA Threshold Signature,
  author = "Long Hoang Nguyen",
  booktitle = "Undergraduate Thesis at Bristol University",
  journal = "Undergraduate Thesis at Bristol University",
  title = "RSA Threshold Signature",
  url = "http://www.comlab.ox.ac.uk/people/long.nguyen/Thesis.pdf",
  year = "2005, Undergraduate Thesis at Bristol University",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'institution' field 
@techreport{RSA Threshold Signature,
  author = "Long Hoang Nguyen",
  booktitle = "Oxford computing technical report, URL: http://web.comlab.ox.ac.uk/oucl/publications/tr/",
  journal = "Oxford computing technical report",
  title = "Partially Interactive Threshold RSA Signatures",
  url = "http://www.comlab.ox.ac.uk/people/long.nguyen/Threshold.pdf",
  year = "2005, Oxford computing technical report",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'institution' field 
@techreport{Hidden Markov Model,
  abstract = "Nuffield Foundation Science Research Bursary",
  author = "Long Hoang Nguyen",
  booktitle = "Nuffield Foundation Science Research Bursary",
  journal = "Technical report for the Nuffield Foundation Science Research Bursary",
  title = "Side Channel Attack By Using Hidden Markov Model",
  url = "http://www.comlab.ox.ac.uk/people/long.nguyen/NuffieldReport.pdf",
  year = "2004, Technical report for the Nuffield Foundation Science Research Bursary",
}


    
      @misc{presentation,
  author = "presnetation",
  title = "presentation",
  year = "2001",
}


    
      @misc{2001 teaching,
  author = "2001, Teaching",
  title = "2001, Teaching",
  year = "2001",
}


    
      @misc{uio,
  author = "jkl",
  title = "jkl",
  year = "2001",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'journal' field 
@article{gjsdfkl,
  author = "Comment 3",
  title = "Comment 3",
  year = "1999",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'author' field 
Missing 'title' field 
Missing 'note' field 
@unpublished{,
}