Sciweavers

261 search results - page 52 / 53
» On the Security of Some Password-Based Key Agreement Schemes
Sort
View
EUROCRYPT
2007
Springer
15 years 1 months ago
Batch Verification of Short Signatures
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
Jan Camenisch, Susan Hohenberger, Michael Ø...
MOBISYS
2005
ACM
15 years 9 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
15 years 3 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
CCS
2007
ACM
15 years 1 months ago
Covert channels in privacy-preserving identification systems
We examine covert channels in privacy-enhanced mobile identification devices where the devices uniquely identify themselves to an authorized verifier. Such devices (e.g. RFID tags)...
Daniel V. Bailey, Dan Boneh, Eu-Jin Goh, Ari Juels
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 3 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin