Sciweavers

524 search results - page 88 / 105
» On the Security of the DeKaRT Primitive
Sort
View
FPL
2007
Springer
154views Hardware» more  FPL 2007»
14 years 1 months ago
Physical Unclonable Functions, FPGAs and Public-Key Crypto for IP Protection
In recent years, IP protection of FPGA hardware designs has become a requirement for many IP vendors. To this end solutions have been proposed based on the idea of bitstream encry...
Jorge Guajardo, Sandeep Kumar, Geert Jan Schrijen,...
AVSS
2005
IEEE
14 years 1 months ago
VidMAP: video monitoring of activity with Prolog
This paper describes the architecture of a visual surveillance system that combines real time computer vision algorithms with logic programming to represent and recognize activiti...
Vinay D. Shet, David Harwood, Larry S. Davis
CSL
2004
Springer
14 years 1 months ago
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
TCC
2004
Springer
101views Cryptology» more  TCC 2004»
14 years 1 months ago
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
Abstract. Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including...
Iftach Haitner
FSTTCS
2003
Springer
14 years 26 days ago
Moderately Hard Functions: From Complexity to Spam Fighting
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Moni Naor