1585 search results - page 4 / 317 » Automatically optimizing secure computation |
SP
2009
IEEE
14 years 2 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
IACR
2011
12 years 7 months ago
2011
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Automatic counting of people, entering or exiting a region of interest, is very important for both business and security applications. This paper introduces an automatic and robus...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE