Sciweavers

783 search results - page 71 / 157
» On security proof of McCullagh
Sort
View
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
CCS
2005
ACM
14 years 2 months ago
PeerAccess: a logic for distributed authorization
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
Marianne Winslett, Charles C. Zhang, Piero A. Bona...
SP
2009
IEEE
101views Security Privacy» more  SP 2009»
14 years 3 months ago
Noninterference for a Practical DIFC-Based Operating System
The Flume system is an implementation of decentralized information flow control (DIFC) at the operating system level. Prior work has shown Flume can be implemented as a practical ...
Maxwell N. Krohn, Eran Tromer
ACISP
2004
Springer
14 years 2 months ago
Weak Property of Malleability in NTRUSign
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...
SungJun Min, Go Yamamoto, Kwangjo Kim
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
14 years 25 days ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen