Sciweavers

2601 search results - page 373 / 521
» Secure Rewarding Schemes
Sort
View
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
15 years 9 months ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
FSE
2001
Springer
116views Cryptology» more  FSE 2001»
15 years 9 months ago
NESSIE: A European Approach to Evaluate Cryptographic Algorithms
The NESSIE project (New European Schemes for Signature, Integrity and Encryption) intends to put forward a portfolio containing the next generation of cryptographic primitives. The...
Bart Preneel
145
Voted
ACSAC
1999
IEEE
15 years 9 months ago
Transactions in Java Card
A smart card runtime environment must provide the proper transaction support for the reliable update of data, especially on multiapplication cards like the Java Card. The transact...
Marcus Oestreicher
159
Voted
OOPSLA
1999
Springer
15 years 9 months ago
Mostly-copying Reachability-based Orthogonal Persistence
We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification t...
Antony L. Hosking, Jiawan Chen
COMPSAC
2009
IEEE
15 years 8 months ago
Leveraging Social Contacts for Message Confidentiality in Delay Tolerant Networks
Delay and disruption tolerant networks (DTNs) can bring much-needed networking capabilities to developing countries and rural areas. DTN features such as high node mobility and in...
Karim M. El Defrawy, John Solis, Gene Tsudik