199 search results - page 3 / 40 » Adaptive Proofs of Knowledge in the Random Oracle Model |
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
ASIACRYPT
2000
Springer
14 years 26 days ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
ASIACRYPT
2006
Springer
14 years 8 days ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
WEWORC
2007
13 years 9 months ago
2007
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
EUROCRYPT
2006
Springer
14 years 5 days ago
2006
Springer
We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems