2432 search results - page 236 / 487 » Cryptographic logical relations |
213
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
171
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
165
click to vote
CCS
2007
ACM
16 years 24 days ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
202
click to vote
FPGA
2004
ACM
16 years 2 hour ago
2004
ACM
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
165
click to vote
ALT
2000
Springer
15 years 11 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...