Sciweavers

570 search results - page 79 / 114
» Black-box constructions for secure computation
Sort
View
ASIACRYPT
2011
Springer
12 years 8 months ago
Leakage-Resilient Cryptography from the Inner-Product Extractor
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
Stefan Dziembowski, Sebastian Faust
IACR
2011
133views more  IACR 2011»
12 years 7 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti
POPL
2004
ACM
14 years 8 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
FOCS
2005
IEEE
14 years 1 months ago
Concurrent Non-Malleable Commitments
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
Rafael Pass, Alon Rosen
ICCSA
2005
Springer
14 years 1 months ago
A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
Almudena Alcaide, Juan M. Estévez-Tapiador,...