120 search results - page 4 / 24 » Functional Encryption for Regular Languages |
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
SPIRE
2010
Springer
13 years 3 months ago
2010
Springer
The retrieval of similar documents in the Web from a given document is different in many aspects from information retrieval based on queries generated by regular search engine use...
PPDP
2001
Springer
13 years 10 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
CCS
2011
ACM
12 years 5 months ago
2011
ACM
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...