Sciweavers

12774 search results - page 31 / 2555
» A Framework for Proof Systems
Sort
View
EUROCRYPT
2008
Springer
13 years 9 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
WOWMOM
2006
ACM
191views Multimedia» more  WOWMOM 2006»
14 years 1 months ago
Privacy Preserving Trust Authorization Framework Using XACML
: Nowadays many organisations share sensitive services through open network systems and this raises the need for an authorization framework that can interoperate even when the part...
Uche M. Mbanaso, G. S. Cooper, David W. Chadwick, ...
MSCS
2007
117views more  MSCS 2007»
13 years 7 months ago
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
Michele Pagani
SEDE
2007
13 years 9 months ago
A framework for constraint checking involving aggregates for multiple XML databases using schematron
Many internet and enterprise applications now not only use XML (eXtensible Markup Language) as a medium for communication but also for storing their data either temporarily for an...
Albin Laga, Praveen Madiraju
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel