A meta-analysis of 87,040 individuals identifies 23 new susceptibility loci for prostate cancer

Genome-wide association studies (GWAS) have identified 76 variants associated with prostate cancer risk predominantly in populations of European ancestry. To identify additional susceptibility loci for this common cancer, we conducted a meta-analysis of > 10 million SNPs in 43,303 prostate cancer cases and 43,737 controls from studies in populations of European, African, Japanese and Latino ancestry. Twenty-three new susceptibility loci were identified at association P < 5 × 10(-8); 15 variants were identified among men of European ancestry, 7 were identified in multi-ancestry analyses and 1 was associated with early-onset prostate cancer. These 23 variants, in combination with known prostate cancer risk variants, explain 33% of the familial risk for this disease in European-ancestry populations. These findings provide new regions for investigation into the pathogenesis of prostate cancer and demonstrate the usefulness of combining ancestrally diverse populations to discover risk loci for disease.

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.