Sciweavers

94 search results - page 6 / 19
» New lattice based cryptographic constructions
Sort
View
CTRSA
2006
Springer
104views Cryptology» more  CTRSA 2006»
14 years 1 months ago
A New Criterion for Nonlinearity of Block Ciphers
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
Orr Dunkelman, Nathan Keller
CCS
2003
ACM
14 years 3 months ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis
ASIACRYPT
2010
Springer
13 years 7 months ago
A Group Signature Scheme from Lattice Assumptions
Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an observer, yet (2) ensuring traceab...
S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan
IACR
2011
115views more  IACR 2011»
12 years 9 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen
ISCAS
2008
IEEE
113views Hardware» more  ISCAS 2008»
14 years 4 months ago
Gramian-preserving frequency transformation for linear discrete-time systems using normalized lattice structure
Abstract— This paper presents a new algorithm for realization of Gramian-preserving frequency transformation for linear discrete-time systems. In the proposed algorithm, we const...
Shunsuke Koshita, Satoru Tanaka, Masahide Abe, Mas...