Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 121 - 135 of 312.

Add to Quick Collection   All 312 Results

Sort:
 Add All Items to Quick Collection
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/117111
Description: Motivated by the need of private set operations in a distributed environment, we extend the two-party private matching problem proposed by Freedman, Nissim and Pinkas (FNP) at Eurocrypt’04 to the dist ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146721
Description: We propose a simple and efficient deterministic extractor for an ordinary elliptic curve E, defined over F₂n , where n = 2ℓ and ℓ is a positive integer. Our extractor, for a given point P on E, output ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/346454
Description: Extractors are an important ingredient in designing key exchange protocols and secure pseudorandom sequences in the standard model. Elliptic and hyperelliptic curves are gaining more and more interest ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/161027
Description: The authors have proposed using category-theoretic sketches to enhance database design and integration methodologies. The algebraic context is called the Sketch Data Model (SkDM) and mathematically de ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/143944
Description: Delay/disruption tolerant networks (DTNs) or intermittently connected mobile networks (ICNs) are mobile ad hoc networks where end-to-end multi-hop paths may not exist and communication routes may only ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/117171
Description: We consider the following problem: a user stores encrypted documents on an untrusted server, and wishes to retrieve all documents containing some keywords without any loss of data confidentiality. Con ... More
Reviewed: Reviewed
Authors: Johnson, Michael
Date: 2008
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/74875
Description: We study some of the mathematical challenges presented by the need to support ensemble engineering, concentrating on likely contributions from category theory and universal algebra. Particular attenti ... More
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/146689
Description: We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli M=pl, where p and l are primes, with prescribed bit ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/46655
Description: A secret sharing scheme typically requires secure communications in each of two distribution phases: (1) a dealer distributes shares to participants (share distribution phase); and later (2) the parti ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/81856
Description: We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrice ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148292
Description: 8 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1228092
Description: 7 page(s)
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/150071
Description: The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tests, that are suitable for reasoning about programs in a total-correctness framework. Abstract algebr ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148339
Description: We consider the issue of finding and presenting counterexamples to a claim “this spec is implemented by that imp”, that is spec⊑imp (refinement), in the context of probabilistic systems: using a geome ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148657
Description: Most of the constructions of pseudorandom graphs are based on additive or multiplicative groups of elements of finite fields. As a result the number of vertices of such graphs is limited to values of ... More
Reviewed: Reviewed