Sciweavers

659 search results - page 127 / 132
» Compiling and securing cryptographic protocols
Sort
View
DCC
2001
IEEE
14 years 7 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler
FC
2007
Springer
117views Cryptology» more  FC 2007»
14 years 1 months ago
Using a Personal Device to Strengthen Password Authentication from an Untrusted Computer
Keylogging and phishing attacks can extract user identity and sensitive account information for unauthorized access to users’ financial accounts. Most existing or proposed solut...
Mohammad Mannan, Paul C. van Oorschot
CRYPTO
2004
Springer
123views Cryptology» more  CRYPTO 2004»
14 years 23 days ago
Asymptotically Optimal Communication for Torus-Based Cryptography
Abstract. We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discretelog based public-key system achieving the o...
Marten van Dijk, David P. Woodruff
INDOCRYPT
2003
Springer
14 years 17 days ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
13 years 11 months ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue