Sciweavers

915 search results - page 17 / 183
» Proof labeling schemes
Sort
View
LPAR
2012
Springer
12 years 3 months ago
Querying Proofs
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
David Aspinall, Ewen Denney, Christoph Lüth
ASIACRYPT
2006
Springer
13 years 11 months ago
Analysis of One Popular Group Signature Scheme
The group signature scheme [1], ACJT for short, is popular. In this paper we show that it is not secure. It does not satisfy exculpability. The group manager can sign on behalf of ...
Zhengjun Cao
CRYPTO
2006
Springer
109views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically s...
Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
13 years 9 months ago
Efficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
ASIACRYPT
2008
Springer
13 years 9 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters