Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Franklin, Matt")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 40

  • Page / 2
Export

Selection :

  • and

CRYPTO 2004 : advances in cryptology (Santa Barbara CA, 15-19 August 2004)Franklin, Matt.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22668-0, XI, 578 p, isbn 3-540-22668-0Conference Proceedings

How to compress Rabin ciphertexts and signatures (and more)GENTRY, Craig.Lecture notes in computer science. 2004, pp 179-200, issn 0302-9743, isbn 3-540-22668-0, 22 p.Conference Paper

Computing the RSA secret key is deterministic polynomial time equivalent to factoringMAY, Alexander.Lecture notes in computer science. 2004, pp 213-219, issn 0302-9743, isbn 3-540-22668-0, 7 p.Conference Paper

Security, liberty, and electronic communicationsLANDAU, Susan.Lecture notes in computer science. 2004, pp 355-372, issn 0302-9743, isbn 3-540-22668-0, 18 p.Conference Paper

On the bounded sum-of-digits discrete logarithm problem in finite fieldsQI CHENG.Lecture notes in computer science. 2004, pp 201-212, issn 0302-9743, isbn 3-540-22668-0, 12 p.Conference Paper

Security of random Feistel schemes with 5 or more roundsPATARIN, Jacques.Lecture notes in computer science. 2004, pp 106-122, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Feistel schemes and bi-linear cryptanalysis: (Extended abstract)COURTOIS, Nicolas T.Lecture notes in computer science. 2004, pp 23-40, issn 0302-9743, isbn 3-540-22668-0, 18 p.Conference Paper

Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacksGENNARO, Rosario.Lecture notes in computer science. 2004, pp 220-236, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Multicollisions in iterated hash functions. Application to cascaded constructionsJOUX, Antoine.Lecture notes in computer science. 2004, pp 306-316, issn 0302-9743, isbn 3-540-22668-0, 11 p.Conference Paper

A new paradigm of hybrid encryption schemeKUROSAWA, Kaoru; DESMEDT, Yvo.Lecture notes in computer science. 2004, pp 426-442, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Secure Identity Based Encryption without random oraclesBONEH, Dan; BOYEN, Xavier.Lecture notes in computer science. 2004, pp 443-459, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Short group signaturesBONEH, Dan; BOYEN, Xavier; SHACHAM, Hovav et al.Lecture notes in computer science. 2004, pp 41-55, issn 0302-9743, isbn 3-540-22668-0, 15 p.Conference Paper

Finding collisions on a public road, or do secure hash functions need secret coins?HSIAO, Chun-Yuan; REYZIN, Leonid.Lecture notes in computer science. 2004, pp 92-105, issn 0302-9743, isbn 3-540-22668-0, 14 p.Conference Paper

Asymptotically optimal communication for torus-based cryptographyVAN DIJK, Marten; WOODRUFF, David.Lecture notes in computer science. 2004, pp 157-178, issn 0302-9743, isbn 3-540-22668-0, 22 p.Conference Paper

IPAKE: Isomorphisms for password-based authenticated key exchangeCATALANO, Dario; POINTCHEVAL, David; PORNIN, Thomas et al.Lecture notes in computer science. 2004, pp 477-493, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Round-optimal secure two-party computationKATZ, Jonathan; OSTROVSKY, Rafail.Lecture notes in computer science. 2004, pp 335-354, issn 0302-9743, isbn 3-540-22668-0, 20 p.Conference Paper

Signature schemes and anonymous credentials from bilinear mapsCAMENISCH, Jan; LYSYANSKAYA, Anna.Lecture notes in computer science. 2004, pp 56-72, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Adaptively secure Feldman VSS and applications to universally-composable threshold cryptographyABE, Masayuki; FEHR, Serge.Lecture notes in computer science. 2004, pp 317-334, issn 0302-9743, isbn 3-540-22668-0, 18 p.Conference Paper

Near-collisions of SHA-0BIHAM, Eli; CHEN, Rafi.Lecture notes in computer science. 2004, pp 290-305, issn 0302-9743, isbn 3-540-22668-0, 16 p.Conference Paper

Privacy-preserving datamining on vertically partitioned databasesDWORK, Cynthia; NISSIM, Kobbi.Lecture notes in computer science. 2004, pp 528-544, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Faster correlation attack on Bluetooth keystream generator E0YI LU; VAUDENAY, Serge.Lecture notes in computer science. 2004, pp 407-425, issn 0302-9743, isbn 3-540-22668-0, 19 p.Conference Paper

Complete classification of bilinear hard-core functionsHOLENSTEIN, Thomas; MAURER, Ueli; SJÖDIN, Johan et al.Lecture notes in computer science. 2004, pp 73-91, issn 0302-9743, isbn 3-540-22668-0, 19 p.Conference Paper

The knowledge-of-exponent assumptions and 3-round zero-knowledge protocolsBELLARE, Mihir; PALACIO, Adriana.Lecture notes in computer science. 2004, pp 273-289, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Zero-knowledge proofs and string commitments withstanding quantum attacksDAMGARD, Ivan; FEHR, Serge; SALVAIL, Louis et al.Lecture notes in computer science. 2004, pp 254-272, issn 0302-9743, isbn 3-540-22668-0, 19 p.Conference Paper

An improved correlation attack against irregular clocked and filtered keystream generatorsMOLLAND, Havard; HELLESETH, Tor.Lecture notes in computer science. 2004, pp 373-389, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

  • Page / 2