3504 search results - page 166 / 701 » Secure protocol composition |
161
click to vote
CARDIS
2010
Springer
16 years 29 days ago
2010
Springer
![The Polynomial Composition Problem in (Z/nZ)[X]](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "The Polynomial Composition Problem in (Z/nZ)[X]")
Let n be an RSA modulus and let P, Q ∈ (Z/nZ)[X]. This paper explores the following problem: Given polynomials Q and Q(P), find polynomial P. We shed light on the connections be...
169
click to vote
CCS
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cas...
184
click to vote
SP
2008
IEEE
15 years 4 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
184
click to vote
ACSW
2006
15 years 7 months ago
2006
To provide card holder authentication while they are conducting an electronic transaction using mobile devices, VISA and MasterCard independently proposed two electronic payment p...
158
Voted
IACR
2011
14 years 5 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...