We present the cryptographic implementation of "DEMOS", a new e-voting system that is endto-end verifiable in the standard model, i.e., without any additional "setup" assumption or access to a random oracle (RO). Previously known end-to-end verifiable e-voting systems required such additional assumptions (specifically, either the existence of a "randomness beacon" or were only shown secure in the RO model). In order to analyze our scheme, we also provide a modeling of endto-end verifiability as well as privacy and receipt-freeness that encompasses previous definitions in the form of two concise attack games.Our scheme satisfies end-to-end verifiability information theoretically in the standard model and privacy/receipt-freeness under a computational assumption (subexponential Decisional Diffie Helman). In our construction, we utilize a number of techniques used for the first time in the context of e-voting schemes that include utilizing randomness from bit-fixing sources, zero-knowledge proofs with imperfect verifier randomness and complexity leveraging.
Zn/Al/La and Zn/Al/La/M (M = Li, Mg, Zr) mixed oxides were obtained by calcination of hydrotalcites and tested for glycerol carbonate synthesis from CO2 carbonylation.
Abstract. Most of the multi-party computation frameworks can be viewed as oblivious databases where data is stored and processed in a secret-shared form. However, data manipulation in such databases can be slow and cumbersome without dedicated protocols for certain database operations. In this paper, we provide efficient protocols for oblivious selection, filtering and shuffle-essential tools in privacy-preserving data analysis. As the first contribution, we present a 1-out-of-n oblivious transfer protocol with O(log log n) rounds, which achieves optimal communication and time complexity and works over any ring ZN . Secondly, we show that the round complexity τ bd of a bit decomposition protocol can be almost matched with oblivious transfer, and that there exists an oblivious transfer protocol with O(τ bd log * n) rounds. Finally, we also show how to construct round-efficient shuffle protocols with optimal asymptotic computation complexity and provide several optimizations.
Compressed sensing (CS), breaking the constriction of Shannon-Nyquist sampling theorem, is a very promising data acquisition technique in the era of multimedia big data. However, the high complexity of CS reconstruction algorithm is a big trouble for endusers who are hardly provided with great computing power. The combination of CS and cloud has the potential of freeing endusers from the resource constraint by cleverly transforming computational workload from the local cilent to the cloud platform. As a result, the low-complexity encoding virtue of CS is fully leveraged in the resource-constrained sensing devices but its highcomplexity decoding problem is effectively addressed in cloud. It seems to be perfect but privacy and security concerns are ignored. In this paper, a secure outsourcing scheme for CS reconstruction service is proposed. Experimental results and security analyses demonstrate that the proposed scheme can restrict malicious access, verify the integrity of the recovered data, and resist brute-force attack, ciphertext-only attack, and plaintext attack.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.