Sciweavers

1628 search results - page 57 / 326
» Compiler Construction Using Scheme
Sort
View
ASIACRYPT
2010
Springer
13 years 8 months ago
A Closer Look at Anonymity and Robustness in Encryption Schemes
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
Payman Mohassel
SAC
2004
ACM
14 years 3 months ago
Adding wildcards to the Java programming language
This paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. Based on the notion of v...
Mads Torgersen, Christian Plesner Hansen, Erik Ern...
AMC
2005
125views more  AMC 2005»
13 years 10 months ago
Wavelet multilayer Taylor Galerkin schemes for hyperbolic and parabolic problems
In this study wavelet based high-order Taylor Galerkin methods is introduced. Additional time layers are used to obtain high-order temporal accuracy unattainable within a two-step...
B. V. Rathish Kumar, Mani Mehra
ASIACRYPT
2006
Springer
14 years 1 months ago
Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to ...
Jacques Patarin, Valérie Nachef, Côme...
STOC
2005
ACM
103views Algorithms» more  STOC 2005»
14 years 10 months ago
New and improved constructions of non-malleable cryptographic protocols
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
Rafael Pass, Alon Rosen