132 search results - page 16 / 27 » New and improved constructions of non-malleable cryptographi... |
CTRSA
2012
Springer
12 years 3 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
FMCO
2003
Springer
14 years 1 months ago
2003
Springer
Web services security specifications are typically expressed as a mixture of XML schemas, example messages, and narrative explanations. We propose a new specification language fo...
ISCAPDCS
2003
13 years 9 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
FOSAD
2000
Springer
13 years 11 months ago
2000
Springer
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
CCS
2007
ACM
14 years 2 months 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...