Sciweavers

930 search results - page 112 / 186
» A Universal Encryption Standard
Sort
View
CRYPTO
2011
Springer
179views Cryptology» more  CRYPTO 2011»
12 years 10 months ago
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
IACR
2011
94views more  IACR 2011»
12 years 9 months ago
Practical Key-recovery For All Possible Parameters of SFLASH
In this paper we present a new practical key-recovery attack on the SFLASH signature scheme. SFLASH is a derivative of the older C∗ encryption and signature scheme that was broke...
Charles Bouillaguet, Pierre-Alain Fouque, Gilles M...
PET
2012
Springer
12 years 15 days ago
PRISM - Privacy-Preserving Search in MapReduce
We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves pr...
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva,...
APLAS
2005
ACM
14 years 3 months ago
An Abstract Interpretation Perspective on Linear vs. Branching Time
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...
Francesco Ranzato, Francesco Tapparo
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...