Authentication is the first defence line to prevent malicious entities to access smart mobile devices (or SMD). Essentially, there exist many available cryptographic primitives to design authentication protocols. Oblivious transfer (OT) protocol is one of the important cryptographic primitives to design authentication protocols. The first lattice-based OT framework under universal composability (UC) model was designed by dual mode encryption and promoted us to find an alternative efficient scheme. We note that “lossy encryption” scheme is an extension of the dual mode encryption and can be used to design UC-secure OT protocol, but the investigations of OT via lossy encryption over the lattice are absent. Hence, in order to obtain an efficie...
Abstract Oblivious Transfer (OT) is the fundamental building block of cryptographic protocols. In th...
Because of the concise functionality of oblivious transfer (OT) protocols, they have been widely use...
Introduced by von Ahn et al. (STOC’05), covert two-party computation is an appealing cryptographic p...
The rapid advances of wireless communication technologies along with the popularity of mobile device...
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications,...
Abstract. We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable s...
We build a two-round, UC-secure oblivious transfer protocol (OT) in the common reference string (CRS...
Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used...
Abstract. Membership encryption is a newly developed cryptographic primitive that combines membershi...
Abstract. The most efficient previously proposed oblivious transfer schemes require t calls of 1-out...
Cachin et al. and Algesheimer et al. proposed schemes using secure function evaluation for protectin...
Security is a major issue for electronic commerce. Crytography is the foundation of security and obl...
Abstract: Cachin et al. and Algesheimer et al. proposed schemes using secure function evaluation for...
We present a general framework for efficient, universally composable oblivious transfer (OT) protoco...
We describe how to construct an oblivious transfer protocol which security is based on subset member...
Abstract Oblivious Transfer (OT) is the fundamental building block of cryptographic protocols. In th...
Because of the concise functionality of oblivious transfer (OT) protocols, they have been widely use...
Introduced by von Ahn et al. (STOC’05), covert two-party computation is an appealing cryptographic p...
The rapid advances of wireless communication technologies along with the popularity of mobile device...
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications,...
Abstract. We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable s...
We build a two-round, UC-secure oblivious transfer protocol (OT) in the common reference string (CRS...
Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used...
Abstract. Membership encryption is a newly developed cryptographic primitive that combines membershi...
Abstract. The most efficient previously proposed oblivious transfer schemes require t calls of 1-out...
Cachin et al. and Algesheimer et al. proposed schemes using secure function evaluation for protectin...
Security is a major issue for electronic commerce. Crytography is the foundation of security and obl...
Abstract: Cachin et al. and Algesheimer et al. proposed schemes using secure function evaluation for...
We present a general framework for efficient, universally composable oblivious transfer (OT) protoco...
We describe how to construct an oblivious transfer protocol which security is based on subset member...
Abstract Oblivious Transfer (OT) is the fundamental building block of cryptographic protocols. In th...
Because of the concise functionality of oblivious transfer (OT) protocols, they have been widely use...
Introduced by von Ahn et al. (STOC’05), covert two-party computation is an appealing cryptographic p...