Sciweavers

2432 search results - page 123 / 487
» Cryptographic logical relations
Sort
View
ECCC
2007
123views more  ECCC 2007»
15 years 4 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
TIT
2008
78views more  TIT 2008»
15 years 4 months ago
Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
The nonlinearity profile of a Boolean function (i.e. the sequence of its minimum Hamming distances nlr(f) to all functions of degrees at most r, for r 1) is a cryptographic crite...
Claude Carlet
JSS
2011
106views more  JSS 2011»
14 years 7 months ago
A family of implementation-friendly BN elliptic curves
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
C. C. F. Pereira Geovandro, Marcos A. Simplí...
155
Voted
CSFW
2012
IEEE
13 years 7 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
116
Voted
ACISP
2003
Springer
15 years 10 months ago
Robust Software Tokens - Yet Another Method for Securing User's Digital Identity
Abstract. This paper presents a robust software token that was developed to protect user’s digital identity by simple software-only techniques. This work is closely related to Ho...
Taekyoung Kwon