Sciweavers

1282 search results - page 225 / 257
» Signing on signing off
Sort
View
ICCV
2011
IEEE
12 years 9 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
ASIACRYPT
2011
Springer
12 years 9 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
IACR
2011
149views more  IACR 2011»
12 years 8 months ago
Public Key Encryption for the Forgetful
We investigate public key encryption that allows the originator of a ciphertext to retrieve a “forgotten” plaintext from the ciphertext. This type of public key encryption wit...
Puwen Wei, Yuliang Zheng, Xiaoyun Wang
TOG
2012
280views Communications» more  TOG 2012»
11 years 11 months ago
What makes Paris look like Paris?
Given a large repository of geotagged imagery, we seek to automatically find visual elements, e.g. windows, balconies, and street signs, that are most distinctive for a certain g...
Carl Doersch, Saurabh Singh, Abhinav Gupta, Josef ...