Sciweavers

60 search results - page 11 / 12
» A Family of Trapdoor Ciphers
Sort
View
DCC
2007
IEEE
15 years 11 months ago
ID-based cryptography using symmetric primitives
A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption ...
Chris J. Mitchell, Fred Piper, Peter R. Wild
FSE
2003
Springer
125views Cryptology» more  FSE 2003»
15 years 4 months ago
On Plateaued Functions and Their Constructions
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
Claude Carlet, Emmanuel Prouff
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 days ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
ASIACRYPT
2000
Springer
15 years 4 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois
IEICET
2006
108views more  IEICET 2006»
14 years 11 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki