Sciweavers

2601 search results - page 212 / 521
» Secure Rewarding Schemes
Sort
View
109
Voted
IJBC
2006
80views more  IJBC 2006»
15 years 3 months ago
Return-Map Cryptanalysis Revisited
As a powerful cryptanalysis tool, the method of return-map attacks can be used to extract secret messages masked by chaos in secure communication schemes. Recently, a simple defen...
Shujun Li, Guanrong Chen, Gonzalo Álvarez
220
Voted
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
14 years 7 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
Richard Lindner, Chris Peikert
134
Voted
ESORICS
2012
Springer
13 years 6 months ago
Unique Group Signatures
We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It ...
Matthew K. Franklin, Haibin Zhang
139
Voted
CCS
2010
ACM
15 years 3 months ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann
112
Voted
HICSS
2009
IEEE
100views Biometrics» more  HICSS 2009»
15 years 10 months ago
A Theoretical Framework for Assessing Eavesdropping-Resistant Authentication Interfaces
A simple theoretical framework is developed to evaluate the security and usability of eavesdroppingresistant authentication schemes. Such schemes strive to allow users to authenti...
Bogdan Hoanca, Kenrick J. Mock