Sciweavers

1005 search results - page 45 / 201
» Practical Secure Function Evaluation
Sort
View
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
14 years 3 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
ACSAC
2009
IEEE
14 years 3 months ago
FPValidator: Validating Type Equivalence of Function Pointers on the Fly
—Validating function pointers dynamically is very useful for intrusion detection since many runtime attacks exploit function pointer vulnerabilities. Most current solutions tackl...
Hua Wang, Yao Guo, Xiangqun Chen
CCS
2010
ACM
14 years 3 months ago
Bureaucratic protocols for secure two-party sorting, selection, and permuting
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenlia...
COMPSEC
2000
117views more  COMPSEC 2000»
13 years 8 months ago
Methods for Protecting Password Transmission
Peyravian and Zunic (2000) proposed a password transmission scheme and a password change scheme over an insecure network. Their proposed solutions do not require the use of any sym...
Mohammad Peyravian, Nevenko Zunic
ICFP
1999
ACM
14 years 1 months ago
Specialization of Inductively Sequential Functional Logic Programs
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
María Alpuente, Michael Hanus, Salvador Luc...