Sciweavers

610 search results - page 35 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 3 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
TCC
2010
Springer
381views Cryptology» more  TCC 2010»
15 years 8 months ago
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
We construct a fully secure HIBE scheme with short ciphertexts. The previous construction of Boneh, Boyen, and Goh was only proven to be secure in the selective model, under a non...
Allison B. Lewko, Brent Waters
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 5 months ago
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda...
105
Voted
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
15 years 26 days ago
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Ba
The main results of this work are new public-key encryption schemes that, under the quadratic residuosity (QR) assumption (or Paillier's decisional composite residuosity (DCR...
Zvika Brakerski, Shafi Goldwasser
ENTCS
2006
173views more  ENTCS 2006»
14 years 11 months ago
Formal Security Analysis for Ad-Hoc Networks
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
Sebastian Nanz, Chris Hankin