Sciweavers

112 search results - page 14 / 23
» Short Randomizable Signatures
Sort
View
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
13 years 12 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
HUC
2007
Springer
14 years 1 months ago
Symbolic Object Localization Through Active Sampling of Acceleration and Sound Signatures
We describe a novel method for symbolic location discovery of simple objects. The method requires no infrastructure and relies on simple sensors routinely used in sensor nodes and ...
Kai S. Kunze, Paul Lukowicz
ICS
2010
Tsinghua U.
14 years 4 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
MOBICOM
2010
ACM
13 years 7 months ago
ZiFi: wireless LAN discovery via ZigBee interference signatures
WiFi networks have enjoyed an unprecedent penetration rate in recent years. However, due to the limited coverage, existing WiFi infrastructure only provides intermittent connectiv...
Ruogu Zhou, Yongping Xiong, Guoliang Xing, Limin S...
ASIACRYPT
2010
Springer
13 years 5 months ago
Constant-Size Commitments to Polynomials and Their Applications
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg