Sciweavers

876 search results - page 32 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
92
Voted
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
15 years 5 months ago
A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
Atefeh Mashatan, Serge Vaudenay
ASIACRYPT
2000
Springer
15 years 5 months ago
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
Shiho Moriai, Serge Vaudenay
138
Voted
CCS
2008
ACM
15 years 2 months ago
Certificateless signcryption
Certificateless cryptography achieves the best of the two worlds: it inherits from identity-based techniques a solution to the certificate management problem in public-key encrypti...
Manuel Barbosa, Pooya Farshim
115
Voted
CTRSA
2007
Springer
98views Cryptology» more  CTRSA 2007»
15 years 2 months ago
Identity-Based Multi-signatures from RSA
Abstract. Multi-signatures allow multiple signers to jointly authenticate a message using a single compact signature. Many applications however require the public keys of the signe...
Mihir Bellare, Gregory Neven
DPHOTO
2010
195views Hardware» more  DPHOTO 2010»
15 years 2 months ago
Direct PSF estimation using a random noise target
Conventional point spread function (PSF) measurement methods often use parametric models for the estimation of the PSF. This limits the shape of the PSF to a specific form provide...
Johannes Brauers, Claude Seiler, Til Aach