1895 search results - page 121 / 379 » Modular Functional Descriptions |
TCC
2012
Springer
12 years 3 months ago
2012
Springer
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
PERCOM
2005
ACM
14 years 7 months ago
2005
ACM
Mobile devices like PDAs or mobile phones have become widespread. Similarly, network functionality like GSM, Bluetooth, or WLAN has become standard. Nevertheless, not many applica...
ACISP
2008
Springer
14 years 2 months ago
2008
Springer
Most of the attacks against (reduced) SHA-2 family in literature have used local collisions which are valid for linearized version of SHA-2 hash functions. Recently, at FSE ’08, ...