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: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/117758
Description: A dynamic accumulator is an algorithm, which gathers together a large set of elements into a constant-size value such that for a given element accumulated, there is a witness confirming that the eleme ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/115356
Description: A secure protocol for electronic, sealed-bid, single item auctions is presented. The protocol caters to both first and second price (Vickrey) auctions and provides full price flexibility. Both computa ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116725
Description: We study the multicast stream authentication problem when an opponent can drop, reorder and inject data packets into the communication channel. In this context, bandwidth limitation and fast authentic ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116757
Description: We consider the following problem: users in a dynamic group store their encrypted documents on an untrusted server, and wish to retrieve documents containing some keywords without any loss of data con ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116722
Description: 17 page(s)
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/118561
Description: In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differentials existing for the st ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116766
Description: In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained examples of near-collisions for ... 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: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/21415
Description: We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholde ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116748
Description: NLS is a stream cipher which was submitted to the eSTREAM project. A linear distinguishing attack against NLS was presented by Cho and Pieprzyk, which was called Crossword Puzzle (CP) attack. NLSv2 is ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/42105
Description: An anonymous membership broadcast scheme is a method in which a sender broadcasts the secret identity of one out of a set of n receivers, in such a way that only the right receiver knows that he is th ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116772
Description: Database watermarking has received significant research attention in the current decade. Although, almost all watermarking models have been either irreversible (the original relation cannot be restore ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/69991
Description: In 2006, Gaurav Gupta and Josef Pieprzyk presented an attack on the branch-based software watermarking scheme proposed by Ginger Myles and Hongxia Jin in 2005. The software watermarking model is based ... More
Full Text: Full Text
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last