Batch Verification of Validity of Bids in Homomorphic E-auction

Bid opening in e-auction is efficient when a homomorphic secret sharing function is employed to seal the bids and homomorphic secret reconstruction is employed to open the bids. However, this high efficiency is based on an assumption: the bids are valid (e.g., within a special range). An undetected invalid bid can compromise correctness and fairness of the auction. Unfortunately, validity verification of the bids is ignored in the auction schemes employing homomorphic secret sharing (called homomorphic auction in this paper). In this paper, an attack against the homomorphic auction in the absence of bid validity check is presented and a necessary bid validity check mechanism is proposed. Then a batch cryptographic technique is introduced and applied to improve the efficiency of bid validity check.

A Multiplicative Homomorphic Sealed-Bid Auction-Based on Goldwasser-Micali Encryption

Instead of the costly encryption algorithms traditionally employed in auction schemes, efficient Goldwasser-Micali encryption is used to design a new sealed-bid auction. Multiplicative homomorphism instead of the traditional additive homomorphism is exploited to achieve security and high efficiency in the auction. The new scheme is the currently known most efficient non-interactive sealed-bid auction with bid privacy.

Residential sales by auction : a property type or geographic consideration

The sale of residential property by auction is a preferred sale method by real estate agents, but not always preferred by some vendors and most residential property buyers. In many residential property markets, the performance and measure of residential property market activity is based on the number of properties offered for sale by auction, auction clearance rates and the number of properties sold prior to auction. However, in many specific residential property markets, sale by auction may not be the preferred or supported method of sale. This paper will review the type of residential property sale within the Sydney residential property market and track the auction sales and clearance rates for Sydney over the past 5 months and compare these results in relation to clearance rates, passed in sales, and properties sold prior to auction This will provide a breakdown of real estate agency sale practice over a large metropolitan region to determine the impact of geographic location and socio-economic factors on the auction of residential property. In addition the paper will analyse the weekly auction sales in the Sydney residential property market to determine what areas of Sydney have the greatest number of house auctions and the performance of the auctions in relation location and socio economic factors.

Misleading and deceptive conduct at an auction

An unusual factual situation recently arose for consideration by Lindsay J of the Federal Circuit Court. In Carter v Delgrove Holdings Pty Ltd [2013] FCCA 783, an application was brought by the owners of a residential property in Western Australia, the Carters, for damages for misleading or deceptive conduct under s 18 of the Australian Consumer Law (“ACL”) and for damages for breach of contract arising from an auction of their house. Delgrove Holdings Pty Ltd was a trustee of a family trust with Mr Ilahi being a director and shareholder of the company as well as a beneficiary under the family trust. It was established that Delgrove Holdings Pty Ltd engaged in the business of property acquisition for the purposes of generating rental income...

Toward Self-Organising Service Communities

This paper discusses a framework in which catalog service communities are built, linked for interaction, and constantly monitored and adapted over time. A catalog service community (represented as a peer node in a peer-to-peer network) in our system can be viewed as domain specific data integration mediators representing the domain knowledge and the registry information. The query routing among communities is performed to identify a set of data sources that are relevant to answering a given query. The system monitors the interactions between the communities to discover patterns that may lead to restructuring of the network (e.g., irrelevant peers removed, new relationships created, etc.).

Compliant cryptologic protocols

Literally, the word compliance suggests conformity in fulfilling official requirements. The thesis presents the results of the analysis and design of a class of protocols called compliant cryptologic protocols (CCP). The thesis presents a notion for compliance in cryptosystems that is conducive as a cryptologic goal. CCP are employed in security systems used by at least two mutually mistrusting sets of entities. The individuals in the sets of entities only trust the design of the security system and any trusted third party the security system may include. Such a security system can be thought of as a broker between the mistrusting sets of entities. In order to provide confidence in operation for the mistrusting sets of entities, CCP must provide compliance verification mechanisms. These mechanisms are employed either by all the entities or a set of authorised entities in the system to verify the compliance of the behaviour of various participating entities with the rules of the system. It is often stated that confidentiality, integrity and authentication are the primary interests of cryptology. It is evident from the literature that authentication mechanisms employ confidentiality and integrity services to achieve their goal. Therefore, the fundamental services that any cryptographic algorithm may provide are confidentiality and integrity only. Since controlling the behaviour of the entities is not a feasible cryptologic goal,the verification of the confidentiality of any data is a futile cryptologic exercise. For example, there exists no cryptologic mechanism that would prevent an entity from willingly or unwillingly exposing its private key corresponding to a certified public key. The confidentiality of the data can only be assumed. Therefore, any verification in cryptologic protocols must take the form of integrity verification mechanisms. Thus, compliance verification must take the form of integrity verification in cryptologic protocols. A definition of compliance that is conducive as a cryptologic goal is presented as a guarantee on the confidentiality and integrity services. The definitions are employed to provide a classification mechanism for various message formats in a cryptologic protocol. The classification assists in the characterisation of protocols, which assists in providing a focus for the goals of the research. The resulting concrete goal of the research is the study of those protocols that employ message formats to provide restricted confidentiality and universal integrity services to selected data. The thesis proposes an informal technique to understand, analyse and synthesise the integrity goals of a protocol system. The thesis contains a study of key recovery,electronic cash, peer-review, electronic auction, and electronic voting protocols. All these protocols contain message format that provide restricted confidentiality and universal integrity services to selected data. The study of key recovery systems aims to achieve robust key recovery relying only on the certification procedure and without the need for tamper-resistant system modules. The result of this study is a new technique for the design of key recovery systems called hybrid key escrow. The thesis identifies a class of compliant cryptologic protocols called secure selection protocols (SSP). The uniqueness of this class of protocols is the similarity in the goals of the member protocols, namely peer-review, electronic auction and electronic voting. The problem statement describing the goals of these protocols contain a tuple,(I, D), where I usually refers to an identity of a participant and D usually refers to the data selected by the participant. SSP are interested in providing confidentiality service to the tuple for hiding the relationship between I and D, and integrity service to the tuple after its formation to prevent the modification of the tuple. The thesis provides a schema to solve the instances of SSP by employing the electronic cash technology. The thesis makes a distinction between electronic cash technology and electronic payment technology. It will treat electronic cash technology to be a certification mechanism that allows the participants to obtain a certificate on their public key, without revealing the certificate or the public key to the certifier. The thesis abstracts the certificate and the public key as the data structure called anonymous token. It proposes design schemes for the peer-review, e-auction and e-voting protocols by employing the schema with the anonymous token abstraction. The thesis concludes by providing a variety of problem statements for future research that would further enrich the literature.

Perceptions of fairness and allocation systems

This paper explores the conditions of acceptability of differing allocation systems under scarcity and evaluates what makes a price system more or less fair. We find that fairness in an allocation arrangement depend on the institutional settings inherent in the situation, such as information, transparency and competition and the perceived institutional quality e.g., fiscal exchange and institutional trust). Results also indicate that the solution “weak people first” is seen as the fairest approach to an excess demand situation, followed by “first come, first serve”, the price system and an auction system. On the other hand, a random procedure or an allocation through the government is not perceived to be fair. Moreover, economics students seemed to be less sceptical towards the price system than other subjects although we observe that female students are more sceptical than male students.

Property Agents and Motor Dealers Act : take two

The Property Agents and Motor Dealers Act 2000 commenced on 1 July 2001. Significant changes have now been made to the Act by the Property Agents and Motor Dealers Amendment Act 2001 (“the amending Act”). The amending Act contains two distinct parts. First, ss 11-19 of the amending Act provide for increased disclosure obligations on real estate agents, property developers and lawyers together with an extension of the 5 business day cooling-off period imposed by the original Act to all residential property (other than contracts formed on a sale by auction). These provisions commenced on 29 October 2001. The remaining provisions of the amending Act provide for increased jurisdiction and powers to the Property Agents and Motor Dealers Tribunal (“the Tribunal”) enabling the Tribunal to deal with claims against marketeers. These provisions commenced on the date of assent, 21 September 2001.