On the validity of the Φ-Hiding assumption in cryptographic protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5350 LNCS, Issue , 2008, Pages 344-354

  Schridde, Christian ^a   Freisleben, Bernd ^a  

^a PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

Hiding assumption; Euler's totient function; Jacobi symbol

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; PROBABILITY DENSITY FUNCTION;

CRYPTOGRAPHIC PROTOCOLS; EULER'S TOTIENT FUNCTION; JACOBI SYMBOL; MATHEMATICAL PROBLEMS; TIME ALGORITHMS;

CRYPTOGRAPHY;

EID: 58349096579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89255-7_21     Document Type: Conference Paper

References (8)

1. Boneh, D., Shacham, H.: Fast Variants of RSA. CryptoBytes 5(1) (Winter/Spring 2002)
2. Cachin, C.: Efficient Private Bidding and Auctions with an Oblivious Third Party. In: ACM Conference on Computer and Communications Security, pp. 120-127 (1999)
3. Cachin, C., Micali, S., Stadler, M.: Computationally Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402-407. Springer, Heidelberg (1999)
4. Eikenberry, S.M., Sorenson, J.P.: Efficient Algorithms for Computing the Jacobi Symbol. Journal of Symbolic Computation 26(4), 509-523 (1998)
5. Gentry, C., Mackenzie, P., Ramzan, Z.: Password Authenticated Key Exchange Using Hidden Smooth Subgroups. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 299-309. ACM Press, New York (2005)
6. Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, Lisbon, Portugal, pp. 803-815 (2005)
7. Hemenway, B., Ostrovsky, R.: Public Key Encryption which is Simultaneously a Locally-Decodable Error-Correcting Code. In: Electronic Colloquium on Computational Complexity, Report No. 21 (2007)
8. Poupard, G., Stern, J.: Fair Encryption of RSA Keys. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 172-189. Springer, Heidelberg (2000)