Sciweavers

773 search results - page 41 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
IANDC
2008
105views more  IANDC 2008»
15 years 2 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
ASIACRYPT
2011
Springer
14 years 1 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
CHES
2008
Springer
128views Cryptology» more  CHES 2008»
15 years 3 months ago
Hash Functions and RFID Tags: Mind the Gap
Abstract. The security challenges posed by RFID-tag deployments are wellknown. In response there is a rich literature on new cryptographic protocols and an on-tag hash function is ...
Andrey Bogdanov, Gregor Leander, Christof Paar, Ax...
ERCIMDL
2006
Springer
113views Education» more  ERCIMDL 2006»
15 years 5 months ago
Representing Aggregate Works in the Digital Library
This paper studies the challenge of representing aggregate works such as encyclopaedia, collected poems and journals in digital libraries. Reflecting on materials used by humanitie...
George Buchanan, Jeremy Gow, Ann Blandford, Jon Ri...
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
16 years 2 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk