120 search results - page 8 / 24 » Functional Encryption for Regular Languages |
JFP
2006
13 years 7 months ago
2006
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
EUROCRYPT
2004
Springer
14 years 26 days ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
ITP
2010
13 years 11 months ago
2010
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...