Sciweavers

90 search results - page 18 / 18
» Pairings for cryptographers
Sort
View
HPDC
2003
IEEE
13 years 10 months ago
Using Views for Customizing Reusable Components in Component-Based Frameworks
Increasingly, scalable distributed applications are being constructed by integrating reusable components spanning multiple administrative domains. Dynamic composition and deployme...
Anca-Andreea Ivan, Vijay Karamcheti
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
13 years 9 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
ASIACRYPT
2003
Springer
13 years 9 months ago
Certificateless Public Key Cryptography
This paper introduces the concept of certificateless public key cryptography (CL-PKC). In contrast to traditional public key cryptographic systems, CL-PKC does not require the use...
Sattam S. Al-Riyami, Kenneth G. Paterson
CSFW
2010
IEEE
13 years 8 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson
JUCS
2008
156views more  JUCS 2008»
13 years 5 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng