Allen Roginsky

According to our database, Allen Roginsky authored at least 21 papers between 1997 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

A new analysis of the false positive rate of a Bloom filter.

Kenneth J. Christensen, Allen Roginsky, Miguel Jimeno

Inf. Process. Lett., 2010

2007

A Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives.

Miguel Jimeno, Kenneth J. Christensen, Allen Roginsky

Proceedings of the 26th IEEE International Performance Computing and Communications Conference, 2007

2005

Performance evaluation of new scheduling methods for the RR/RR CICQ switch.

Kenji Yoshigoe, Kenneth J. Christensen, Allen Roginsky

Comput. Commun., 2005

Targeted search: reducing the time and cost for searching for objects in multiple-server networks.

Graciela Perera, Ken Christensen, Allen Roginsky

Proceedings of the 24th IEEE International Performance Computing and Communications Conference, 2005

2004

Performance Evaluation of Packet-to-Cell Segmentation Schemes in Input Buffered Packet Switches

Kenneth J. Christensen, Kenji Yoshigoe, Allen Roginsky, Neil J. Gunther

CoRR, 2004

Non-PKI methods for public key distribution.

Mohammad Peyravian, Allen Roginsky, Nevenko Zunic

Comput. Secur., 2004

Performance of packet-to-cell segmentation schemes in input buffered packet switches.

Kenneth J. Christensen, Kenji Yoshigoe, Allen Roginsky, Neil J. Gunther

Proceedings of IEEE International Conference on Communications, 2004

2003

Methods for preventing unauthorized software distribution.

Mohammad Peyravian, Allen Roginsky, Nevenko Zunic

Comput. Secur., 2003

Design of a High-Speed Overlapped Round Robin (ORR) Arbiter.

Kenji Yoshigoe, Kenneth J. Christensen, Allen Roginsky

Proceedings of the 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), 2003

2001

Alternative Method for Unique RSA Primes Generation.

Mohammad Peyravian, Stephen M. Matyas, Allen Roginsky, Nevenko Zunic

Comput. Secur., 2001

2000

Ticket and Challenge-Based Protocols for Timestamping.

Mohammad Peyravian, Stephen M. Matyas, Allen Roginsky, Nevenko Zunic

Comput. Secur., 2000

Multiparty Biometric-Based Authentication.

Mohammad Peyravian, Stephen M. Matyas, Allen Roginsky, Nevenko Zunic

Comput. Secur., 2000

Generation of RSA Keys That Are Guaranteed to be Unique for Each User.

Mohammad Peyravian, Stephen M. Matyas, Allen Roginsky, Nevenko Zunic

Comput. Secur., 2000

1999

Hash-based encryption system.

Mohammad Peyravian, Allen Roginsky, Nevenko Zunic

Comput. Secur., 1999

Generating user-based cryptographic keys and random numbers.

Mohammad Peyravian, Stephen M. Matyas, Allen Roginsky, Nevenko Zunic

Comput. Secur., 1999

New methods for shortest path selection for multimedia traffic with two delay constraints.

Allen Roginsky, Kenneth J. Christensen, V. Srinivasan

Comput. Commun., 1999

An Effective Defense Against First Party Attacks in Public-Key Algorithms.

Stephen M. Matyas, Allen Roginsky

Proceedings of the 15th Annual Computer Security Applications Conference (ACSAC 1999), 1999

1998

On probabilities of hash value matches.

Mohammad Peyravian, Allen Roginsky, Ajay D. Kshemkalyani

Comput. Secur., 1998

Reversible data mixing procedure for efficient public-key encryption.

Mike Matyas, Mohammad Peyravian, Allen Roginsky, Nevenko Zunic

Comput. Secur., 1998

Efficient computation of packet CRC from partial CRCs with application to the Cells-In-Frames protocol.

Allen Roginsky, Kenneth J. Christensen, Steven Polge

Comput. Commun., 1998

1997

Two-phase cryptographic key recovery system.

Rosario Gennaro, Paul A. Karger, Stephen M. Matyas, Mohammad Peyravian, Allen Roginsky, David Safford, Michael Willett, Nevenko Zunic

Comput. Secur., 1997