Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 14 of 14.

Add to Quick Collection   All 14 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2005
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116703
Description: 15 page(s)
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100510
Description: In this paper we make progress towards solving an open problem posed by Katz and Yung at CRYPTO 2003. We propose the first protocol for key exchange among n ≥2k+1 parties which simultaneously achieves ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100695
Description: Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the attractive feature of ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/100899
Description: We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an S-b ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/107298
Description: Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the s ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116769
Description: Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most signature schemes are r ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116920
Description: 17 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/117339
Description: The cryptographic hash function literature has numerous hash function definitions and hash function requirements, and many of them disagree. This survey talks about the various definitions, and takes ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148602
Description: 15 page(s)
Reviewed: Reviewed
Authors: Steinfeld, Ron
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1244316
Description: 23 page(s)
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/147985
Description: We describe public key encryption schemes with security provably based on the worst case hardness of the approximate Shortest Vector Problem in some structured lattices, called ideal lattices. Under t ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148162
Description: 18 page(s)
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/150097
Description: NTRUEncrypt, proposed in 1996 by Hoffstein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic performance and conjectured resista ... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last