62 search results - page 10 / 13 » Groth-Sahai Proofs Revisited |
122
Voted
COCOON
2009
Springer
15 years 5 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
104
click to vote
ESAS
2004
Springer
15 years 4 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
APLAS
2007
ACM
15 years 2 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
BIRTHDAY
2012
Springer
13 years 6 months ago
2012
Springer
The 40 thieves realize that the fortune in their cave is vanishing. A rumor says that Ali Baba has been granted access (in the form of a certificate) to the cave but they need evi...
CRYPTO
2009
Springer
15 years 5 months ago
2009
Springer
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...