Sciweavers

623 search results - page 88 / 125
» A proposal for Ontology Security Standards
Sort
View
EUROCRYPT
2004
Springer
14 years 2 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer
ESORICS
2006
Springer
14 years 19 days ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...
CCS
2010
ACM
13 years 9 months ago
Modeling attacks on physical unclonable functions
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...
CTRSA
2007
Springer
112views Cryptology» more  CTRSA 2007»
14 years 3 months ago
Directed Transitive Signature Scheme
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...
Xun Yi
ISSA
2004
13 years 10 months ago
High Data Rate 8-Bit Crypto Processor
This paper describes a high data rate 8-bit Crypto Processor based on Advanced Encryption Standard (Rijndael algorithm). Though the algorithm requires 32-bit wide data path but ou...
Sheikh Muhammad Farhan