Sciweavers

8381 search results - page 1311 / 1677
» The security of machine learning
Sort
View
ECCC
2008
98views more  ECCC 2008»
15 years 6 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
ENTCS
2006
103views more  ENTCS 2006»
15 years 6 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
CLEIEJ
2007
86views more  CLEIEJ 2007»
15 years 6 months ago
Requirements Game: Teaching Software Project Management
: Several business areas, like Management and Negotiation, have used games like a didactic way to simulate world reality, to introduce students to the day-to-day generated problems...
Carlos Mario Zapata Jaramillo, Gabriel Awad-Aubad
EC
2000
136views ECommerce» more  EC 2000»
15 years 6 months ago
Architecture for an Artificial Immune System
An artificial immune system (ARTIS) is described which incorporates many properties of natural immune systems, including diversity, distributed computation, error tolerance, dynam...
Steven A. Hofmeyr, Stephanie Forrest
CANS
2010
Springer
146views Cryptology» more  CANS 2010»
15 years 4 months ago
Anonymous Credential Schemes with Encrypted Attributes
In anonymous credential schemes, users obtain credentials on certain attributes from an issuer, and later show these credentials to a relying party anonymously and without fully di...
Jorge Guajardo, Bart Mennink, Berry Schoenmakers
« Prev « First page 1311 / 1677 Last » Next »