2237 search results - page 210 / 448 » On the Security of Random Sources |
176
Voted
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
164
click to vote
ACSAC
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper we examine the problem of entering sensitive data, such as passwords, from an untrusted machine. By untrusted we mean that it is suspected to be infected with spywar...
180
Voted
ASIACRYPT
2006
Springer
15 years 11 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
233
click to vote
IMC
2010
ACM
15 years 5 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
197
click to vote
IACR
2011
14 years 6 months ago
2011
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...