Sciweavers

5 search results - page 1 / 1
» Redactable Signatures for Tree-Structured Data: Definitions ...
Sort
View
ACNS
2010
Springer
155views Cryptology» more  ACNS 2010»
13 years 8 months ago
Redactable Signatures for Tree-Structured Data: Definitions and Constructions
ded abstract of this paper appears in Applied Cryptography and Network Security
Christina Brzuska, Heike Busch, Özgür Da...
TCC
2012
Springer
240views Cryptology» more  TCC 2012»
12 years 10 days ago
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...
BTW
2007
Springer
133views Database» more  BTW 2007»
13 years 8 months ago
Pathfinder: XQuery Compila-tion Techniques for Relational Database Targets
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
Jens Teubner
ICFP
2005
ACM
14 years 4 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
ICFP
2008
ACM
14 years 4 months ago
Mixin' up the ML module system
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
Derek Dreyer, Andreas Rossberg