# Moses Liskov

According to our database

Collaborative distances:

^{1}, Moses Liskov authored at least 25 papers between 1999 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Task-structured probabilistic I/O automata.

J. Comput. Syst. Sci., 2018

2017

A practical, perfectly secure password scheme in the bounded retrieval model.

IACR Cryptology ePrint Archive, 2017

2012

Automatic Reconfiguration for Large-Scale Reliable Storage Systems.

IEEE Trans. Dependable Sec. Comput., 2012

2011

Maurer's Method.

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Fermat Primality Test.

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Tweakable Block Ciphers.

J. Cryptology, 2011

2010

MPSS: Mobile Proactive Secret Sharing.

ACM Trans. Inf. Syst. Secur., 2010

On Related-Secret Pseudorandomness.

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

2008

Analyzing Security Protocols Using Time-Bounded Task-PIOAs.

Discrete Event Dynamic Systems, 2008

Mobile proactive secret sharing.

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Online-Untransferable Signatures.

Proceedings of the Public Key Cryptography, 2008

2007

On Tweaking Luby-Rackoff Blockciphers.

IACR Cryptology ePrint Archive, 2007

On Tweaking Luby-Rackoff Blockciphers.

Proceedings of the Advances in Cryptology, 2007

2006

Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols.

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Constructing an Ideal Hash Function from Weak Ideal Compression Functions.

Proceedings of the Selected Areas in Cryptography, 13th International Workshop, 2006

2005

Miller-Rabin Probabilistic Primality Test.

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Fermat's Little Theorem.

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol.

IACR Cryptology ePrint Archive, 2005

Updatable Zero-Knowledge Databases.

Proceedings of the Advances in Cryptology, 2005

2004

New tools in cryptography: mutually independent commitments, tweakable block ciphers, and plaintext awareness via key registration.

PhD thesis, 2004

2003

Plaintext Awareness via Key Registration.

Proceedings of the Advances in Cryptology, 2003

2002

Tweakable Block Ciphers.

Proceedings of the Advances in Cryptology, 2002

2001

Amortized E-Cash.

Proceedings of the Financial Cryptography, 2001

Mutually Independent Commitments.

Proceedings of the Advances in Cryptology, 2001

1999

Efficient Finite Field Basis Conversion Involving Dual Bases.

Proceedings of the Cryptographic Hardware and Embedded Systems, 1999