Filters








9,889 Hits in 3.4 sec

Pairing-Based Cryptography: Past, Present, and Future [chapter]

Dan Boneh
2012 Lecture Notes in Computer Science  
While pairings were first introduced in cryptography as a tool to attack the discrete-log problem on certain elliptic curves, they have since found numerous applications in the construction of cryptographic  ...  A few examples include collusionresistant broadcast encryption and traitor tracing with short keys, 3-way Diffie-Hellman, and short signatures.  ...  One of the central applications of pairings is identity-based encryption and its generalization to functional encryption.  ... 
doi:10.1007/978-3-642-34961-4_1 fatcat:t37a37zs5bbq5hpsaeeo66c2de

Internet security standards: past, present, and future

Stephen Kent
1994 StandardView  
Appropriately designed, IP-layer cryptographic devices offer (connectionless) confidentiality and integrity, data-origin authentication, and enforcement of identity and rule-based access control through  ...  The model assumes the use of end-to-end cryptographic protection at the network layer for most user-oriented security services and the use of link layer cryptography for trafftc-flow confidentiality.  ...  Despite the focus on and the preference for use of public-key cryptography, PEM also defines means for using symmetric cryptography for the primary security services.  ... 
doi:10.1145/202949.202954 fatcat:lktt2jl5ljaxjloa3paoorh7o4

Report on Pairing-based Cryptography

Dustin Moody, Rene Peralta, Ray Perlner, Andrew Regenscheid, Allen Roginsky, Lily Chen
2015 Journal of Research of the National Institute of Standards and Technology  
The workshop program included presentations on new applications of pairing-based cryptography.  ...  Several presenters described how IBE and other pairing-based cryptography schemes were being used in pilot projects and live systems. The workshop also had two panel discussions.  ...  We therefore recommend NIST standardize IBE and pairing-based cryptography.  ... 
doi:10.6028/jres.120.002 pmid:26958435 pmcid:PMC4730686 fatcat:zxzb76skivd5zhfg5hmiohichq

AI Evaluation: past, present and future [article]

Jose Hernandez-Orallo
2016 arXiv   pre-print
We describe the limitations of the many evaluation settings and competitions in these three categories and propose several ideas for a more systematic and robust evaluation.  ...  We see that black-box (behavioural evaluation) is becoming more and more common, as AI systems are becoming more complex and unpredictable.  ...  AI Evaluation: past, present and future∗ José Hernández-Orallo  ... 
arXiv:1408.6908v3 fatcat:6g5h2nzaezey5a3qy3us7lnkvu

Past, Present and Future of Research in the Information Society

Kerry Smith, W Shrum, K Benson, W Bijker, K Brunnstein
2007 Australian Academic and Research Libraries  
Since the cryptanalysis concepts are highly specialized and complex, we concentrate here only on some of the key mathematical concepts behind cryptography. cryptology is made up of cryptography and cryptanalysis  ...  Cryptology is the mathematics, such as number theory, and the application of formulas and algorithms, that underpin cryptography and cryptanalysis.  ...  Thus the receiver can present data and the digital signature to a third party as evidence if any dispute arises in the future.  ... 
doi:10.1080/00048623.2007.10721285 fatcat:5kia2etpcbh5zavkxuge4o74uu

The Past, Evolving Present, and Future of the Discrete Logarithm [chapter]

Antoine Joux, Andrew Odlyzko, Cécile Pierrot
2014 Open Problems in Mathematics and Computational Science  
This paper presents a current 1 survey of the state of the art concerning discrete logarithms and their computation.  ...  This intractability hypothesis is also the foundation for the security of a large variety of other public key systems and protocols.  ...  It gives pointers to the latest results and presents observations about the current status and likely future of the DLP.  ... 
doi:10.1007/978-3-319-10683-0_2 fatcat:ykp3rhh2lnhn5ml4otrrfszoii

Quantum Cryptography Protocol Based on Sending Entangled Qubit Pairs [article]

Olli Ahonen
2007 arXiv   pre-print
Instead of sending single particles one-by-one as in BB84, they are grouped and a non-local transformation is applied to each group before transmission.  ...  We calculate the maximal information on the established key provided by an intercept-resend attack and the induced disturbance for different transformations.  ...  Because of the possibility of recording encrypted transmissions, the security of not only future but also all past public-key-encrypted communication is based on a conjecture of the difficulty of the key  ... 
arXiv:0712.4247v1 fatcat:tdfmzmqlpjh2fel5cvas2l5phm

GIMI: the past, the present and the future

A. Simpson, D. Power, D. Russell, M. Slaymaker, V. Bailey, C. Tromans, M. Brady, L. Tarassenko
2010 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
In keeping with the theme of this year's e-Science All Hands Meeting-past, present and future-we consider the motivation for, the current status of, and the future directions for, the technologies developed  ...  GIMI was funded by the UK's Technology Strategy Board with the intention of developing a service-oriented framework to facilitate the secure sharing and aggregation of heterogeneous data from disparate  ...  Igor Toujilov, Gordon Wilcock and Moi Hoon Yap.  ... 
doi:10.1098/rsta.2010.0153 pmid:20643683 fatcat:2qej4mezazfgxn7jnv6id7ezpe

A review on genetic algorithm: past, present, and future

Sourabh Katoch, Sumit Singh Chauhan, Vijay Kumar
2020 Multimedia tools and applications  
This review will help the new and demanding researchers to provide the wider vision of genetic algorithms. The well-known algorithms and their implementation are presented with their pros and cons.  ...  The future research directions in the area of genetic operators, fitness function and hybrid algorithms are discussed. This structured review will be helpful for research and graduate teaching.  ...  Section 6 presents the challenges and future research directions. The concluding remarks are drawn in Section 7.  ... 
doi:10.1007/s11042-020-10139-6 pmid:33162782 pmcid:PMC7599983 fatcat:bg6phhszfzfbrjwazncc5p34bi

The Past, Present and Future of the German Record Linkage Center (GRLC)

Manfred Antoni, Rainer Schnell
2017 Jahrbücher für Nationalökonomie und Statistik  
The DFG grants were awarded to Rainer Schnell (SCHN 586/17-2) and Stefan Bender (BE 3172/1-2). The funding for the two groups ended in 2016 and 2015, respectively.  ...  Based on these data, their future work will focus on, for instance, the utility of such linked data for nonresponse bias adjustments for survey data.  ...  However, in general, there are no absolute guarantees in cryptography: "Breakthroughs in cryptanalysis can happen suddenly and unexpectedly (. . . ).  ... 
doi:10.1515/jbnst-2017-1004 fatcat:pct4cbaqizakfdt4iz2bnycvye

Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography [chapter]

Alfred Menezes, Palash Sarkar, Shashank Singh
2017 Lecture Notes in Computer Science  
This article presents a concise overview of these algorithms and discusses some of the challenges with assessing their impact on keylengths for pairing-based cryptosystems.  ...  In the past two years there have been several advances in Number Field Sieve (NFS) algorithms for computing discrete logarithms in finite fields Fpn where p is prime and n > 1 is a small integer.  ...  Acknowledgements We thank the referees for their comments which helped improve the presentation of the paper.  ... 
doi:10.1007/978-3-319-61273-7_5 fatcat:jefi5xpxljhi5mqpoxygpowume

A Comprehensive Survey on Affinity Analysis, Bibliomining, and Technology Mining: Past, Present, and Future Research

Md. Rashadur Rahman, Mohammad Shamsul Arefin, Sanjida Rahman, Afsana Ahmed, Tahsina Islam, Pranab Kumar Dhar, Oh-Jin Kwon
2022 Applied Sciences  
We present a systematic review of the notable research articles in the fields of affinity analysis, bibliomining, and technology mining published between 2000 and December 2021.  ...  Finally, this article provides insight into major advances and outstanding challenges in the fields of affinity analysis, bibliomining, and technology mining.  ...  [29] We selected 29 papers on affinity analysis, 16 papers on bibliomining, and 8 papers on technology mining from various publishers, including IEEE, ACM, ScienceDirect, Springer- Conflicts of Interest  ... 
doi:10.3390/app12105227 fatcat:xe5vqxyizvdc5obyeg4zuiocai

Kleptography: Using Cryptography Against Cryptography [chapter]

Adam Young, Moti Yung
1997 Lecture Notes in Computer Science  
The strong attacks employ the discrete logarithm as a one-way function (assuring what is called "forward secrecy"), public-key cryptography, and a technique which we call probabilistic bias removal.  ...  The SETUP mechanisms presented here, in contrast with previous ones, leak secret key information without using an explicit subliminal channel.  ...  Acknowledgments: We would like t o acknowledge Jo Schueth for pointing out the statistical attack on the RSA key setup and Hari Sundaram for improving the efficiency of the PBRM recovery algorithm.  ... 
doi:10.1007/3-540-69053-0_6 fatcat:e2vwl2izxfcqhb6mjvuybgdndu

New field of cryptography: DNA cryptography

Guozhen Xiao, Mingxin Lu, Lei Qin, Xuejia Lai
2006 Science Bulletin  
the major fields of future cryptography.  ...  future study.  ... 
doi:10.1007/s11434-006-2012-5 fatcat:wjh73wmrgzdvlmdfruq5ia6kfi

Nature-inspired cryptography: past, present and future

J.A. Clark
The 2003 Congress on Evolutionary Computation, 2003. CEC '03.  
A general comment may be made on the ways schemes based on NP-complete problems are often presented.  ...  The (N-gram, points) pairs were ("TH',+2), ("HE",+1) ("IN",+1), ("ER",+1), ("AN",+1), ("ED", +1), ("THE",+5),("ING",+5),("AND",+5) and ("EEE",-5).  ... 
doi:10.1109/cec.2003.1299870 fatcat:75fvzfupmffsnarq5newbo7m4i
« Previous Showing results 1 — 15 out of 9,889 results