4 search results - page 1 / 1 » How to Break and Repair a Universally Composable Signature F... |
139
click to vote
ISW
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
154
Voted
INDOCRYPT
2005
Springer
15 years 10 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
200
click to vote
IACR
2011
14 years 4 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
157
click to vote
PKC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...