12 search results - page 2 / 3 » A Trapdoor Permutation Equivalent to Factoring |
EUROCRYPT
1998
Springer
13 years 9 months ago
1998
Springer
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
JCT
2008
13 years 5 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
ACL
2006
13 years 6 months ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...