Sciweavers

102 search results - page 15 / 21
» Secure Sketch for Multiple Secrets
Sort
View
ASIACRYPT
2010
Springer
15 years 1 months ago
Leakage Resilient ElGamal Encryption
Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order...
Eike Kiltz, Krzysztof Pietrzak
107
Voted
CCS
2009
ACM
15 years 10 months ago
Reactive noninterference
Many programs operate reactively, patiently waiting for user input, subsequently running for a while producing output, and eventually returning to a state where they are ready to ...
Aaron Bohannon, Benjamin C. Pierce, Vilhelm Sj&oum...
IACR
2011
115views more  IACR 2011»
14 years 3 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky
129
Voted
MSN
2005
Springer
15 years 9 months ago
Using MDS Codes for the Key Establishment of Wireless Sensor Networks
Key pre-distribution techniques for security provision of Wireless Sensor Networks (WSNs) have attracted significant interests recently. In these schemes, a relatively small numbe...
Jing Deng, Yunghsiang S. Han
127
Voted
CCS
2008
ACM
15 years 5 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki