1005 search results - page 145 / 201 » Practical Secure Function Evaluation |
CRYPTO
2003
Springer
14 years 3 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
WWW
2010
ACM
14 years 5 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
SIGSOFT
2004
ACM
14 years 11 months ago
2004
ACM
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
CCS
2010
ACM
13 years 10 months ago
2010
ACM
Decentralized information flow control (DIFC) operating systems provide applications with mechanisms for enforcing information-flow policies for their data. However, significant o...