Bruce M. Kapron

Des. Codes Cryptogr., 2018

Type-two polynomial-time and restricted lookahead.

[BibT_eX]

[DOI]

Florian Steinberg

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

A Survey of Classes of Primitive Recursive Functions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

MMH<sup>⁎</sup> with arbitrary modulus is always almost-universal.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Simultaneous Secrecy and Reliability Amplification for a General Channel Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2016, 2016

On a variant of multilinear modular hashing with applications to authentication and secrecy codes.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Semantically Non-preserving Transformations for Antivirus Evaluation.

[BibT_eX]

[DOI]

Erkan Ersan

Lior Malka

Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

Stability of certainty and opinion in influence networks.

[BibT_eX]

[DOI]

Ariel Webster

Valerie King

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

A framework for non-interactive instance-dependent commitment schemes (NIC).

[BibT_eX]

[DOI]

Lior Malka

S. Venkatesh

Theor. Comput. Sci., 2015

Restricted linear congruences.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

On an almost-universal hash function family with applications to authentication and secrecy codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Dynamic graph connectivity with improved worst case update time and sublinear space.

[BibT_eX]

[DOI]

CoRR, 2015

Restricted linear congruences and an authenticated encryption scheme.

[BibT_eX]

[DOI]

CoRR, 2015

On almost-universal multilinear modular hashing with composite moduli.

[BibT_eX]

[DOI]

S. Venkatesh

CoRR, 2015

Gambling, Computational Information and Encryption Security.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 8th International Conference, 2015

Reproducible Circularly-Secure Bit Encryption: Applications and Realizations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Anonymization and De-anonymization of Social Network Data.

[BibT_eX]

[DOI]

Encyclopedia of Social Network Analysis and Mining, 2014

2013

Complexity of social network anonymization.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

Computational Soundness of Coinductive Symbolic Security under Active Attacks.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Dynamic graph connectivity in polylogarithmic worst case time.

[BibT_eX]

[DOI]

Valerie King

Ben Mountjoy

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2011

Social Network Anonymization via Edge Addition.

[BibT_eX]

[DOI]

Gautam Srivastava

S. Venkatesh

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011

k-Anonymization of Social Networks by Vertex Addition.

[BibT_eX]

[DOI]

Proceedings of the ADBIS 2011, 2011

2010

On the Equality of Probabilistic Terms.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Computational indistinguishability logic.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2008

Fast asynchronous byzantine agreement and leader election with full information.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).

[BibT_eX]

[DOI]

Lior Malka

Srinivasan Venkatesh

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Lower bound for scalable Byzantine Agreement.

[BibT_eX]

[DOI]

Dan Holtby

Valerie King

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

2003

Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193].

[BibT_eX]

[DOI]

Joseph Y. Halpern

Ann. Pure Appl. Log., 2003

The modal logic of the countable random frame.

[BibT_eX]

[DOI]

Valentin Goranko

Arch. Math. Log., 2003

Logics for Reasoning about Cryptographic Constructions.

[BibT_eX]

[DOI]

Russell Impagliazzo

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

2001

On characterizations of the basic feasible functionals (Part I).

[BibT_eX]

[DOI]

Robert J. Irwin

James S. Royer

J. Funct. Program., 2001

2000

Resource-Bounded Continuity and Sequentiality for Type-Two Functionals.

[BibT_eX]

[DOI]

Samuel R. Buss

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999

A note on negative tagging for least fixed-point formulae.

[BibT_eX]

[DOI]

Dilian Gurov

RAIRO Theor. Informatics Appl., 1999

Feasibly Continuous Type-Two Functionals.

[BibT_eX]

[DOI]

Comput. Complex., 1999

1996

A New Characterization of Type-2 Feasibility.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

A modal mu-calculus and a proof system for value passing processes.

[BibT_eX]

[DOI]

Dilian Gurov

Sergey Berezin

Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

1994

The Parameterized Complexity of Some Problems in Logic and Linguistics.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Parallel computable higher type functionals (Extended Abstract)

[BibT_eX]

[DOI]

Peter Clote

Aleksandar Ignjatovic

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Zero-One Laws for Modal Logic

[BibT_eX]

[DOI]

Joseph Y. Halpern

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

Feasible computation in higher types.

[BibT_eX]

[DOI]

PhD thesis, 1991

A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989

Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1987

Modal Sequents and Definability.

[BibT_eX]

[DOI]