57 search results - page 7 / 12 » On Multiplicative Linear Secret Sharing Schemes |
ET
2010
13 years 7 months ago
2010
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
IJNSEC
2011
13 years 3 months ago
2011
In this paper, a new multi authority electronic voting scheme based on elliptic curves is proposed. According to the proposed scheme, each voter casts the vote as a point on the e...
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
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...
ASPLOS
2006
ACM
14 years 2 months ago
2006
ACM
Security has been considered as an important issue in processor design. Most of the existing mechanisms address security and integrity issues caused by untrusted main memory in si...
COCO
1993
Springer
14 years 21 days ago
1993
Springer
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...