Sciweavers

222 search results - page 30 / 45
» How to Forget a Secret
Sort
View
DCC
2005
IEEE
15 years 9 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye
ICTAI
2009
IEEE
15 years 4 months ago
Emergence of Memory-like Behavior in Reactive Agents Using External Markers
Early primitive animals with simple feed-forward neuronal circuits were limited to reactive behavior. Through evolution, they were gradually equipped with memory and became able t...
Ji Ryang Chung, Yoonsuck Choe
HOST
2008
IEEE
15 years 4 months ago
Slicing Up a Perfect Hardware Masking Scheme
—Masking is a side-channel countermeasure that randomizes side-channel leakage, such as the power dissipation of a circuit. Masking is only effective on the condition that the in...
Zhimin Chen, Patrick Schaumont
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
15 years 2 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
ESORICS
2009
Springer
15 years 10 months ago
Reliable Evidence: Auditability by Typing
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
Nataliya Guts, Cédric Fournet, Francesco Za...