Sciweavers

175 search results - page 11 / 35
» A Directed Signature Scheme Based on RSA Assumption
Sort
View
86
Voted
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 3 months ago
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda...
CRYPTO
2000
Springer
122views Cryptology» more  CRYPTO 2000»
15 years 1 months ago
Efficient Non-malleable Commitment Schemes
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
Marc Fischlin, Roger Fischlin
JCP
2008
216views more  JCP 2008»
14 years 9 months ago
Direct Anonymous Attestation for Next Generation TPM
Trusted computing platforms have been proposed as a promising approach to enhance the security of general-purpose computing systems. Direct Anonymous Attestation(DAA) is a scheme t...
Xiaofeng Chen 0004, Dengguo Feng
85
Voted
BIRTHDAY
2012
Springer
13 years 5 months ago
Deniable RSA Signature - The Raise and Fall of Ali Baba
The 40 thieves realize that the fortune in their cave is vanishing. A rumor says that Ali Baba has been granted access (in the form of a certificate) to the cave but they need evi...
Serge Vaudenay
PODC
2003
ACM
15 years 2 months ago
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...