Conferences in DBLP
Carlo Blundo , Alfredo De Santis , Douglas R. Stinson , Ugo Vaccaro Graph Decompositions and Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Frankel , Yvo Desmedt Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Thierry Baritaud , Henri Gilbert , Marc Girault FFT Hashing is not Collision-free. [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr FFT-Hash II, Efficient Cryptographic Hashing. [Citation Graph (0, 0)][DBLP ] Conf ] Xuejia Lai , James L. Massey Hash Function Based on Block Ciphers. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Berson Differential Cryptanalysis Mod 2^32 with Applications to MD5. [Citation Graph (0, 0)][DBLP ] Conf ] Mitsuru Matsui , Atsuhiro Yamagishi A New Method for Known Plaintext Attack of FEAL Cipher. [Citation Graph (0, 0)][DBLP ] Conf ] Kaisa Nyberg On the Construction of Highly Nonlinear Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Ralph Wernsdorf The One-Round Functions of the DES Generate the Alternating Group. [Citation Graph (0, 0)][DBLP ] Conf ] Jovan Dj. Golic Correlation via Linear Sequential Circuit Approximation of Combiners with memory. [Citation Graph (0, 0)][DBLP ] Conf ] Miodrag J. Mihaljevic , Jovan Dj. Golic Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift register Sequence. [Citation Graph (0, 0)][DBLP ] Conf ] Luke O'Connor , Tim Snider Suffix Tree and String Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Birgit Pfitzmann , Michael Waidner Attacks on Protocols for Server-Aided RSA Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Harper , Alfred Menezes , Scott A. Vanstone Public-Key Cryptosystems with Very Small Key Length. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Sauerbrey , Andreas Dietel Resource Requirements for the Application of Addition Chains in Modulo Exponentiation. [Citation Graph (0, 0)][DBLP ] Conf ] Brandon Dixon , Arjen K. Lenstra Massively Parallel Elliptic Curve Factorin. [Citation Graph (0, 0)][DBLP ] Conf ] Yvo Desmedt , Peter Landrock , Arjen K. Lenstra , Kevin S. McCurley , Andrew M. Odlyzko , Rainer A. Rueppel , Miles E. Smid The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). [Citation Graph (0, 0)][DBLP ] Conf ] Ernest F. Brickell , Daniel M. Gordon , Kevin S. McCurley , David Bruce Wilson Fast Exponentiation with Precomputation (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Beller , Yacov Yacobi Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications. [Citation Graph (0, 0)][DBLP ] Conf ] Keiichi Iwamura , Tsutomu Matsumoto , Hideki Imai High-Speed Implementation Methods for RSA Scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Ueli M. Maurer A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Patarin How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function. [Citation Graph (0, 0)][DBLP ] Conf ] Babak Sadeghiyan , Josef Pieprzyk A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Beaver How to Break a "Secure" Oblivious Transfer Protocol. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Barbaroux Uniform Results in Polynomial-Time Security. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Beaver , Stuart Haber Cryptographic Protocols Provably Secure Against Dynamic Adversaries. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Ohta , Tatsuaki Okamoto , Atsushi Fujioka Secure Bit Commitment Function against Divertibility. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Damgård Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing. [Citation Graph (0, 0)][DBLP ] Conf ] Ingrid Biehl , Johannes Buchmann , Bernd Meyer , Christian Thiel , Christoph Thiel Tools for Proving Zero Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Eugène van Heyst , Torben P. Pedersen How to Make Efficient Fail-stop Signatures. [Citation Graph (0, 0)][DBLP ] Conf ] Jan-Hendrik Evertse , Eugène van Heyst Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol? [Citation Graph (0, 0)][DBLP ] Conf ] David Chaum , Torben P. Pedersen Transferred Cash Grows in Size. [Citation Graph (0, 0)][DBLP ] Conf ] Harald Niederreiter , Claus-Peter Schnorr Local Randomness in Candidate One-Way Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Tatsuaki Okamoto , Kouichi Sakurai , Hiroki Shizuya How Intractable Is the Discrete Logarithm for a General Finite Group? [Citation Graph (0, 0)][DBLP ] Conf ] Ueli M. Maurer Factoring with an Oracle. [Citation Graph (0, 0)][DBLP ] Conf ] Rafi Heiman Secure Audio Teleconferencing: A Practical Solution. [Citation Graph (0, 0)][DBLP ] Conf ] Kenji Koyama Secure Conference Key Distribution Schemes for Conspiracy Attack. [Citation Graph (0, 0)][DBLP ] Conf ] Rafi Heiman A Note on Discrete Logorithms with Special Structure. [Citation Graph (0, 0)][DBLP ] Conf ] Ueli M. Maurer , Yacov Yacobi A Remark on a Non-interactive Public-Key Distribution System. [Citation Graph (0, 0)][DBLP ] Conf ] Lidong Chen , Ivan Damgård Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Sgarro Information-Theoretic Bounds for Authentication Frauds. [Citation Graph (0, 0)][DBLP ] Conf ] Jovan Dj. Golic , Slobodan V. Petrovic A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Keiichi Iwamura , Tsutomu Matsumoto , Hideki Imai Systolic-Arrays for Modular Exponentiation Using Montgomery Method (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Gordon B. Agnew , Ronald C. Mullin , Scott A. Vanstone On the Development of a Fast Elliptic Curve Cryptosystem. [Citation Graph (0, 0)][DBLP ] Conf ] David Naccache A Montgomery-Suitable Fiat-Shamir-like Authenication Scheme. [Citation Graph (0, 0)][DBLP ] Conf ] 