977 search results - page 71 / 196 » Secure Computation with Fixed-Point Numbers |
COMPSAC
2009
IEEE
14 years 3 months ago
2009
IEEE
As computing technology becomes increasingly pervasive and interconnected, mobility leads to shorter-lasting relationships between end-points with many different security requirem...
CCS
2008
ACM
13 years 11 months ago
2008
ACM
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
ASIACRYPT
2011
Springer
12 years 9 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
FOCS
2007
IEEE
14 years 3 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...