Titlebook: Information Theoretic Security; Third International Reihaneh Safavi-Naini Conference proceedings 2008 Springer-Verlag Berlin Heidelberg 20

遗留之物

Upper Bounds for Set Systems with the Identifiable Parent PropertyWe derive upper bounds on the size of set systems having the .-identifiable parent property (.-IPP) and the .-traceability property (.-TA).

材料等

Oblivious Transfer Based on the McEliece AssumptionsWe implement one-out-of-two bit oblivious transfer (OT) based on the assumptions used in the McEliece cryptosystem: the hardness of decoding random binary linear codes, and the difficulty of distinguishing a permuted generating matrix of Goppa codes from a random matrix. To our knowledge this is the first OT reduction to these problems only.

ingenue

https://doi.org/10.1007/978-3-540-85093-9DES; DoS attacks; Information; access control; broadcast encryption; coding theory; communication; complexi

prodrome

Conference proceedings 2008. The 14 papers presented in this volume were carefully reviewed and selected from 43 submissions. There were nine invited speeches to the conference. The topics covered are secure and reliable communication; quantum information and communication; networks and devices; multiparty computation; inform

使出神

reperfusion

Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromiseigh confidence in the security of the protocol, and modest scaling of resource costs with improvement of the security parameter. Although some types of failure are undetectable, users can take preemptive measures to make the probability of such failures arbitrarily small.

催眠

Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplificationon of string (1,2)-OT to Rabin’s OT by using a deterministic randomness extractor for bit-fixing sources. Our reduction can be realized without privacy amplification and thus our protocol is simpler and more efficient with respect to the communication complexity than the previous reductions.

Perceive

郊外

Statistical Security Conditions for Two-Party Secure Function Evaluationthese results to the statistical case, where the protocol is allowed to make errors with a small probability. Our results are based on a new measure of information that we call the ., which may be of independent interest.

Alopecia-Areata