Sciweavers

773 search results - page 52 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
DRM
2007
Springer
16 years 10 days ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
TACAS
2007
Springer
105views Algorithms» more  TACAS 2007»
16 years 8 days ago
Hoare Logic for Realistically Modelled Machine Code
This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of rea...
Magnus O. Myreen, Michael J. C. Gordon
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
16 years 8 days ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to a...
Jörn Müller-Quade, Dominique Unruh
ICALP
2005
Springer
15 years 11 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
ICALP
2005
Springer
15 years 11 months ago
Append-Only Signatures
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Bara...