Sciweavers

2237 search results - page 223 / 448
» On the Security of Random Sources
Sort
View
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
Eric Brier, Jean-Sébastien Coron, Thomas Ic...
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 7 months ago
JIT Spraying and Mitigations
With the discovery of new exploit techniques, novel protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Random...
Piotr Bania
JOC
2011
102views more  JOC 2011»
15 years 2 months ago
Wildcarded Identity-Based Encryption
In this paper we introduce a new primitive called identity-based encryption with wildcards, or WIBE for short. It allows a sender to encrypt messages to a whole range of receivers ...
Michel Abdalla, James Birkett, Dario Catalano, Ale...
FSTTCS
2003
Springer
16 years 10 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
DCC
2002
IEEE
16 years 6 months ago
Quantizers with Uniform Encoders and Channel Optimized Decoders
Scalar quantizers with uniform encoders and channel optimized decoders are studied for uniform sources and binary symmetric channels. It is shown that the Natural Binary Code and ...
Benjamin Farber, Kenneth Zeger