4212 search results - page 44 / 843 » On Compressible Pairings and Their Computation |
87
Voted
DCC
2003
IEEE
16 years 3 days ago
2003
IEEE
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
93
Voted
ANTS
2006
Springer
15 years 4 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
92
Voted
AINA
2005
IEEE
15 years 6 months ago
2005
IEEE
In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on ...
115
Voted
BIRTHDAY
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We pair session types and contracts using two encodings. The encoding of session types accommodates width and depth subtyping, two properties that partially hold in contr...
101
Voted
MVA
2000
15 years 9 days ago
2000
We present a linear rectification algorithm for general, unconstrained stereo rigs. The algorithm takes the two perspective projection matrices of the original cameras, and compute...