Sciweavers

94 search results - page 19 / 19
» New lattice based cryptographic constructions
Sort
View
FMCO
2003
Springer
121views Formal Methods» more  FMCO 2003»
13 years 10 months ago
TulaFale: A Security Tool for Web Services
Web services security specifications are typically expressed as a mixture of XML schemas, example messages, and narrative explanations. We propose a new specification language fo...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
FOCS
1990
IEEE
13 years 9 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 7 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
LATINCRYPT
2010
13 years 3 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...