Non-interactive Oblivious Transfer Protocols
Two novel constructions of one out of n oblivious transfer protocols from bilinear maps between groups are proposed. The protocols satisfy the category of non-interactive, mean that any sender S can obliviously transfer some secret(s) to a receiver R, but R does not send any messages back to S. The choice of a receiver is unconditionally secure. A sender's secrecy is guaranteed if the receiver is semi-honest in a standard model since the decision bilinear Diffie-Hellman problem is hard and the sender's secrecy is achieved when the receiver is a malicious party in a random oracle model since the bilinear Diffie-Hellman problem assumption holds. When a sender is a cheating party, the receiver will detect him/her and halt the protocol. A precise proof of the security of the protocols is presented.
Adopting a nonlinear dynamical system analysis point of view, we discuss the design of a low-complexity CMOS electronic circuit implementing a Physically Unclonable Function core module based on a two-neurons Cellular Neural Network. The study follows a theoretical approach investigating the circuit topology, aiming at proposing a methodological engineering approach for the design of this class of systems.