29 search results - page 6 / 6 » Homomorphic Signatures for Polynomial Functions |
CSFW
2007
IEEE
13 years 12 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
SP
2006
IEEE
13 years 11 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
PAIRING
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
AES
2004
Springer
13 years 11 months ago
2004
Springer
This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate alg...