Sciweavers

225 search results - page 28 / 45
» Weakly-Private Secret Sharing Schemes
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 11 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
DCC
2010
IEEE
13 years 7 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
ICISC
2004
147views Cryptology» more  ICISC 2004»
13 years 9 months ago
Batch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
HyoJin Yoon, Jung Hee Cheon, Yongdae Kim
NDSS
2007
IEEE
14 years 1 months ago
Secret Handshakes with Dynamic and Fuzzy Matching
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have ...
Giuseppe Ateniese, Jonathan Kirsch, Marina Blanton
CTRSA
2001
Springer
120views Cryptology» more  CTRSA 2001»
14 years 53 min ago
Forward-Secure Threshold Signature Schemes
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remain...
Michel Abdalla, Sara K. Miner, Chanathip Namprempr...