Titlebook: Information Theoretic Security; 10th International C Junji Shikata Conference proceedings 2017 Springer International Publishing AG 2017 Au

多嘴

,Catching MPC Cheaters: Identification and?Openability, with three new properties to discourage cheating. First is a strengthening of ., called . identifiable abort, where all parties who do not follow the protocol will be identified as cheaters by each honest party. The second is ., which means that a third party can determine whether the computation w

調(diào)味品

轉(zhuǎn)換

Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutatiocards. In existing card-based cryptographic protocols, a special operation of cards called a . is used to achieve the information-theoretic security. Recently, card-based cryptographic protocols have been reconsidered from the viewpoint of multi-party computations. In this direction, a new model of

嚙齒動物

小木槌

Secure Network Coding for Multiple Unicast: On the Case of Single Source, destinations. The primal goal is to characterize the secure capacity region, where the exchanged messages have to be secured from a passive external eavesdropper that has unbounded computational capabilities, but limited network presence. The secure capacity region for the case of two destinations

Medicaid

,Rényi Resolvability and Its Applications to the Wiretap Channel,istribution of a channel in either the total variation distance or the relative entropy. In this paper, we use the (normalized or unnormalized) Rényi divergence (with the Rényi parameter in [0,2]) to measure the level of approximation. We also provide asymptotic expressions for normalized Rényi dive

小蟲

978-3-319-72088-3Springer International Publishing AG 2017

dearth

Information Theoretic Security978-3-319-72089-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

coddle

https://doi.org/10.1007/978-3-319-72089-0Authentication codes; Adversarial channel models; Biometric security; Bounded storage models; Informatio

朦朧