12,833 research outputs found
On the Use of Secret Sharing as a Secure Multi-use Pad
Secret sharing (SS) is a cryptographic method proposed independently by Adi Shamir and George Blakley in 1979 to encode the keys of public-key cryptography by splitting them into maximally entropic shares that are distributed to participants, only revealing the secret when combined. Each new sharing instance, even of the same key, produces a different set of shares to distribute anew. This paper investigates SS as an independent cipher to secure confidential messages between a limited set of trusted participants by eliminating the need to redistribute shares. A participant's master share is permanently fixed and unlimited temporary shares are created and combined with it to reveal new messages. Security is argued against specific and general attacks
Making Code Voting Secure against Insider Threats using Unconditionally Secure MIX Schemes and Human PSMT Protocols
Code voting was introduced by Chaum as a solution for using a possibly
infected-by-malware device to cast a vote in an electronic voting application.
Chaum's work on code voting assumed voting codes are physically delivered to
voters using the mail system, implicitly requiring to trust the mail system.
This is not necessarily a valid assumption to make - especially if the mail
system cannot be trusted. When conspiring with the recipient of the cast
ballots, privacy is broken.
It is clear to the public that when it comes to privacy, computers and
"secure" communication over the Internet cannot fully be trusted. This
emphasizes the importance of using: (1) Unconditional security for secure
network communication. (2) Reduce reliance on untrusted computers.
In this paper we explore how to remove the mail system trust assumption in
code voting. We use PSMT protocols (SCN 2012) where with the help of visual
aids, humans can carry out addition correctly with a 99\% degree of
accuracy. We introduce an unconditionally secure MIX based on the combinatorics
of set systems.
Given that end users of our proposed voting scheme construction are humans we
\emph{cannot use} classical Secure Multi Party Computation protocols.
Our solutions are for both single and multi-seat elections achieving:
\begin{enumerate}[i)]
\item An anonymous and perfectly secure communication network secure against
a -bounded passive adversary used to deliver voting,
\item The end step of the protocol can be handled by a human to evade the
threat of malware. \end{enumerate} We do not focus on active adversaries
Quantum secret sharing between multi-party and multi-party without entanglement
We propose a quantum secret sharing protocol between multi-party ( members
in group 1) and multi-party ( members in group 2) using a sequence of single
photons. These single photons are used directly to encode classical information
in a quantum secret sharing process. In this protocol, all members in group 1
directly encode their respective keys on the states of single photons via
unitary operations, then the last one (the member of group 1) sends
of the resulting qubits to each of group 2. Thus the secret message
shared by all members of group 1 is shared by all members of group 2 in such a
way that no subset of each group is efficient to read the secret message, but
the entire set (not only group 1 but also group 2) is. We also show that it is
unconditionally secure. This protocol is feasible with present-day techniques.Comment: 6 pages, no figur
Quantum secret sharing between m-party and n-party with six states
We propose a quantum secret sharing scheme between -party and -party
using three conjugate bases, i.e. six states. A sequence of single photons,
each of which is prepared in one of the six states, is used directly to encode
classical information in the quantum secret sharing process. In this scheme,
each of all members in group 1 choose randomly their own secret key
individually and independently, and then directly encode their respective
secret information on the states of single photons via unitary operations, then
the last one (the th member of group 1) sends of the resulting qubits
to each of group 2. By measuring their respective qubits, all members in group
2 share the secret information shared by all members in group 1. The secret
message shared by group 1 and group 2 in such a way that neither subset of each
group nor the union of a subset of group 1 and a subset of group 2 can extract
the secret message, but each whole group (all the members of each group) can.
The scheme is asymptotically 100% in efficiency. It makes the Trojan horse
attack with a multi-photon signal, the fake-signal attack with EPR pairs, the
attack with single photons, and the attack with invisible photons to be
nullification. We show that it is secure and has an advantage over the one
based on two conjugate bases. We also give the upper bounds of the average
success probabilities for dishonest agent eavesdropping encryption using the
fake-signal attack with any two-particle entangled states. This protocol is
feasible with present-day technique.Comment: 7 page
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
We present Chameleon, a novel hybrid (mixed-protocol) framework for secure
function evaluation (SFE) which enables two parties to jointly compute a
function without disclosing their private inputs. Chameleon combines the best
aspects of generic SFE protocols with the ones that are based upon additive
secret sharing. In particular, the framework performs linear operations in the
ring using additively secret shared values and nonlinear
operations using Yao's Garbled Circuits or the Goldreich-Micali-Wigderson
protocol. Chameleon departs from the common assumption of additive or linear
secret sharing models where three or more parties need to communicate in the
online phase: the framework allows two parties with private inputs to
communicate in the online phase under the assumption of a third node generating
correlated randomness in an offline phase. Almost all of the heavy
cryptographic operations are precomputed in an offline phase which
substantially reduces the communication overhead. Chameleon is both scalable
and significantly more efficient than the ABY framework (NDSS'15) it is based
on. Our framework supports signed fixed-point numbers. In particular,
Chameleon's vector dot product of signed fixed-point numbers improves the
efficiency of mining and classification of encrypted data for algorithms based
upon heavy matrix multiplications. Our evaluation of Chameleon on a 5 layer
convolutional deep neural network shows 133x and 4.2x faster executions than
Microsoft CryptoNets (ICML'16) and MiniONN (CCS'17), respectively
- …