Sciweavers

978 search results - page 87 / 196
» Knowledge, Probability, and Adversaries
Sort
View
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
15 years 4 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak
ENTCS
2006
134views more  ENTCS 2006»
14 years 10 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
CORR
2007
Springer
127views Education» more  CORR 2007»
14 years 10 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
ASIACRYPT
2011
Springer
13 years 10 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
ICALT
2003
IEEE
15 years 3 months ago
Adaptive Exploration of Assessment Results under Uncertainty
In the context of Intelligent Learning Environments (ILE), adaptivity plays a key role. In order to achieve adaptive behavior an ILE should have a rich representation of the learn...
Dimitris Lamboudis, Anastasios A. Economides, Anas...