Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 25.

Add to Quick Collection   All 25 Results

Sort:
 Add All Items to Quick Collection
Date: 2011
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/144970
Description: Boolean functions and their Möbius transforms are involved in logical calculation, digital communications, coding theory and modern cryptography. So far, little is known about the relations of Boolean ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/117602
Description: We present two unconditional secure protocols for private set disjointness tests. In order to provide intuition of our protocols, we give a naive example that applies Sylvester matrices. Unfortunately ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/117133
Description: We present efficient protocols for private set disjointness tests. We start from an intuition of our protocols that applies Sylvester matrices. Unfortunately, this simple construction is insecure as i ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/123879
Description: 16 page(s)
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/98372
Description: New criteria of extended resiliency and extended immunity of vectorial Boolean functions, such as S-boxes for stream or block ciphers, were recently introduced. They are related to a divide-and-conque ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/8834
Description: The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restriction of regular mapp ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/98356
Description: Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function against algebraic attacks. Currently known algorithms for computing the optimal annihilator of f and A ... More
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/117815
Description: We characterise ideal threshold schemes from different approaches. Since the characteristic properties are independent to particular descriptions of threshold schemes, all ideal threshold schemes can ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/117816
Description: 12 page(s)
Full Text: Full Text
Reviewed: Reviewed
Date: 2004
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/8419
Description: The XOR Lemma states that a mapping is regular or balanced if and only if all the linear combinations of the component functions of the mapping are balanced Boolean functions. The main contribution of ... More
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116522
Description: 5 page(s)
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1244763
Description: Nonlinear Boolean functions play an important role in the design of block ciphers, stream ciphers and one-way hash functions. Over the years researchers have identified a number of indicators that for ... More
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/116539
Description: We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the cor ... More
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/29503
Description: Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown ... More
Reviewed: Reviewed
Date: 2002
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/29533
Description: The work addresses the problem of cheating prevention in secret sharing. Two cheating scenarios are considered. In the first one, the cheaters always submit invalid shares to the combiner. In the seco ... More
Reviewed: Reviewed