Sciweavers

204 search results - page 41 / 41
» On Provably Secure Time-Stamping Schemes
Sort
View
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
14 years 2 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
POLICY
2007
Springer
14 years 1 months ago
Distributed Enforcement of Unlinkability Policies: Looking Beyond the Chinese Wall
We present a discretionary access control framework that can be used to control a principal’s ability to link information from two or more audit records and compromise a user’...
Apu Kapadia, Prasad Naldurg, Roy H. Campbell
ASIACRYPT
2003
Springer
14 years 1 months ago
The Insecurity of Esign in Practical Implementations
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
Pierre-Alain Fouque, Nick Howgrave-Graham, Gwena&e...
USS
2010
13 years 5 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...