Sciweavers

2601 search results - page 230 / 521
» Secure Rewarding Schemes
Sort
View
INFOCOM
2006
IEEE
16 years 20 days ago
Secure Localization with Hidden and Mobile Base Stations
— Until recently, the problem of localization in wireless networks has been mainly studied in a non-adversarial setting. Only recently, a number of solutions have been proposed t...
Srdjan Capkun, Mario Cagalj, Mani B. Srivastava
FC
2010
Springer
196views Cryptology» more  FC 2010»
15 years 10 months ago
Secure Multiparty AES
Abstract We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expe...
Ivan Damgård, Marcel Keller
ICASSP
2008
IEEE
16 years 1 months ago
Cryptographic measures in information hiding
Recent information hiding schemes are scrutinized in terms of their cryptographic performance. We establish conditions under which the key equivocation function is optimal for the...
Phillip A. Regalia
PKC
2007
Springer
117views Cryptology» more  PKC 2007»
16 years 23 days ago
Identity-Based Traitor Tracing
We present the first identity-based traitor tracing scheme. The scheme is shown to be secure in the standard model, assuming the bilinear decision Diffie-Hellman (DBDH) is hard in...
Michel Abdalla, Alexander W. Dent, John Malone-Lee...
CTRSA
2003
Springer
120views Cryptology» more  CTRSA 2003»
15 years 12 months ago
Simple Backdoors for RSA Key Generation
We present extremely simple ways of embedding a backdoor in the key generation scheme of RSA. Three of our schemes generate two genuinely random primes p and q of a given size, to...
Claude Crépeau, Alain Slakmon