Universal Security

Identity-Based Encryption from the Weil Pairing

Boneh, D., & Franklin, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_13 · Cited by 7,090 · see citing works

Polynomial Codes Over Certain Finite Fields

Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,693 · see citing works

Universal classes of hash functions

Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,554 · see citing works

Modern computer algebra

(2000) · Choice Reviews Online · doi:10.5860/choice.37-5723 · Cited by 1,593 · see citing works

New hash functions and their use in authentication and set equality

Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402 · see citing works

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

Gennaro, R., Gentry, C., & Parno, B. J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,156 · see citing works

Efficient Non-interactive Proof Systems for Bilinear Groups

Groth, J., & Sahai, A. (2008) · Springer eBooks · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,078 · see citing works

A One Round Protocol for Tripartite Diffie–Hellman

Joux, A. (2000) · Lecture notes in computer science · doi:10.1007/10722028_23 · Cited by 1,040 · see citing works

Introduction to Coding Theory

Roth, R. (2006) · doi:10.1017/cbo9780511808968 · Cited by 912 · see citing works

Non-interactive zero-knowledge and its applications

Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904 · see citing works

Quadratic Span Programs and Succinct NIZKs without PCPs

Gennaro, R., Gentry, C., Parno, B. J., & Raykova, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_37 · Cited by 751 · see citing works

Cryptosystems based on pairing

Kasahara, M. (2000) · Medical Entomology and Zoology · Cited by 733 · see citing works

On span programs

Karchmer, M., & Wigderson, A. (2002) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/sct.1993.336536 · Cited by 493 · see citing works

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493 · see citing works

Separating succinct non-interactive arguments from all falsifiable assumptions

Gentry, C., & Wichs, D. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993651 · Cited by 456 · see citing works

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

Groth, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_19 · Cited by 454 · see citing works

Codes Which Detect Deception

Gilbert, E. N., Macwilliams, F. J., & Sloane, N. J. A. (1974) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1974.tb02751.x · Cited by 385 · see citing works

On Some Sequences of Integers

Erdos, P. L., & Túrán, P. (1936) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-11.4.261 · Cited by 320 · see citing works

Recursive composition and bootstrapping for SNARKS and proof-carrying data

Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488623 · Cited by 305 · see citing works

Zaps and Their Applications

Dwork, C., & Naor, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892117 · Cited by 264 · see citing works

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

Lipmaa, H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_10 · Cited by 223 · see citing works

Universal circuits (Preliminary Report)

Valiant, L. G. (1976) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800113.803649 · Cited by 169 · see citing works

On the Evaluation of Powers and Monomials

Pippenger, N. J. (1980) · SIAM Journal on Computing · doi:10.1137/0209022 · Cited by 147 · see citing works

Reflections for quantum query algorithms

Reichardt, B. W. (2011) · Cited by 103 · see citing works

Span-program-based quantum algorithm for evaluating formulas

Reichardt, B. W., & Špalek, R. (2008) · doi:10.1145/1374376.1374394 · Cited by 96 · see citing works

An improved construction of progression-free sets

Elkin, M. (2011) · Israel Journal of Mathematics · doi:10.1007/s11856-011-0061-1 · Cited by 94 · see citing works

Span programs for functions with constant-sized 1-certificates

Belovs, A. (2012) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2213977.2213985 · Cited by 83 · see citing works

Bounding Fan-out in Logical Networks

Hoover, H. J., Klawe, M. M., & Pippenger, N. J. (1984) · Journal of the ACM · doi:10.1145/2422.322412 · Cited by 78 · see citing works

Succinct NP Proofs from an Extractability Assumption

Crescenzo, G. D., & Lipmaa, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69407-6_21 · Cited by 59 · see citing works

A characterization of span program size and improved lower bounds for monotone span programs

G�l, A. (2001) · Computational Complexity · doi:10.1007/s000370100001 · Cited by 52 · see citing works

A Non-interactive Range Proof with Constant Communication

Chaabouni, R., Lipmaa, H., & Zhang, B. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32946-3_14 · Cited by 43 · see citing works

Lower bounds for monotone span programs

Beimel, A., Gál, A., & Paterson, M. (1995) · doi:10.1109/sfcs.1995.492669 · Cited by 28 · see citing works

Span-program-based quantum algorithm for the rank problemPreprint

Belovs, A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.0842 · Cited by 13 · see citing works

New Developments in Quantum Algorithms

Ambainis, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15155-2_1 · Cited by 10 · see citing works

Separating the power of monotone span programs over different fields

Beimel, A., & Weinreb, E. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238216 · Cited by 7 · see citing works

New Non-Interactive Zero-Knowledge Subset Sum, Decision Knapsack And Range Arguments.Preprint

Lipmaa, H., & Zhang, B. (2012) · IACR Cryptology ePrint Archive · Cited by 2 · see citing works

A Practical Evaluation of a High-Security Energy-Efficient Gateway for IoT Fog Computing Applications

Suárez-Albela, M., Fernández-Caramés, T., Fraga-Lamas, P., & Castedo, L. (2017) · Sensors · doi:10.3390/s17091978 · Cited by 125 · see citing works

Clock Frequency Impact on the Performance of High-Security Cryptographic Cipher Suites for Energy-Efficient Resource-Constrained IoT Devices

Suárez-Albela, M., Fraga-Lamas, P., Castedo, L., & Fernández-Caramés, T. M. (2018) · Sensors · doi:10.3390/s19010015 · Cited by 35 · see citing works

Primitive Constituent Elements of Cryptographic Protocols

Ishibashi, S., Yan, J., Goto, Y., et al. (2018) · doi:10.1109/smartworld.2018.00068

A Study on Fine-Grained Security Properties of Cryptographic Protocols for Formal Analysis Method with Reasoning

Yan, J., Ishibashi, S., Goto, Y., et al. (2018) · doi:10.1109/smartworld.2018.00071 · Cited by 2 · see citing works

A Simple and Efficient Approach to Verifying Cryptographic Protocols

Sun, Y., & Wang, X. (2000) · IFIP advances in information and communication technology · doi:10.1007/978-0-387-35515-3_20

Algebra model and security analysis for cryptographic protocols

HUAIJinpeng, & LIXianxian (2004) · Acta Scientiarum Naturalium Universitatis Sunyatseni · Cited by 2 · see citing works

A New Security Proof of Practical Cryptographic Devices Based on Hardware, Software and Protocols

Wang, A., Li, Z., Yang, X., & Yu, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21031-0_29