نتایج جستجو برای: position based cryptography

تعداد نتایج: 3129196  

2007
Matt Blaze

This paper is a high-level technical overview of the impact of cryptography on the computing and communications industries, with emphasis on the implications of the Administration’s recent cryptography policy initiatives. It represents the best judgement of its author, and does not necessarily reflect the position of AT&T or any other organization. We argue that unless a fundamental change is m...

Journal: :IJACT 2008
Xavier Boyen

This paper surveys the practical benefits and drawbacks of several identitybased encryption schemes based on bilinear pairings. After providing some background on identity-based cryptography, we classify the known constructions into a handful of general approaches. We then describe efficient and fully-secure IBE and IBKEM instantiations of each approach, with reducibility to practice as the mai...

Journal: :IACR Cryptology ePrint Archive 2006
Jason E. Gower

We use the Bateman-Horn conjecture to study the order of the set of Fq-rational points of primitive subgroups that arise in torus-based cryptography. We provide computational evidence to support the heuristics and make some suggestions regarding parameter selection for torus-based cryptography.

2012
Naoyuki Shinohara Huan-Bang Li Kenji Fujikawa

11 Summer Science Camp 2012 Report 09 ◇Advanced ICT Research Institute Report on Facility Open House ◇Children’s Day for Visiting Kasumigaseki Report ◇Keihanna Information and Communication Fair 2012 ◇Facility Open House 2012 Prize Winners -Establishes security of pairing-based cryptography and contributes to its standardization as the next-generation cryptographyWorld Record Cryptanalysis of a...

Journal: :CoRR 2009
Jennifer Balakrishnan Juliana Belding Sarah Chisholm Kirsten Eisenträger Katherine E. Stange Edlyn Teske

We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many direction...

Journal: :Journal of physics 2022

Abstract The development of the communication technology era has made it easier in process exchanging information from various parties. However, not all provided can be used by many Sometimes is intended for partial purposes only or confidential. So, necessary to security. Several ways such as cryptography. This method encrypt messages information. Methods that cryptography include vigenere cip...

Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...

Journal: :JSW 2011
Yang Ming Xiaoqin Shen Yamian Peng

A sanitizable signature scheme is a signature which allows a semi-trusted party called sanitizer to hide parts of the original message after the message is signed, without interacting with the signer. A verifier can confirm the integrity of disclosed parts of the sanitized document from the signature. Sanitizable signatures are quite useful in governmental or military offices, where there is a ...

2018
Vasileios Mavroeidis Kamer Vishi Mateusz D. Zych Audun Josang

The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms. In particular the reader can delve into the following subjects: present cryptographic schemes (symmetric and asymmetric), differences between quantum and classical computing, challenges in quantum computing, quantum algorithms (Shor’s ...

Journal: :IACR Cryptology ePrint Archive 2016
Sanjit Chatterjee Neal Koblitz Alfred Menezes Palash Sarkar

How to deal with large tightness gaps in security proofs is a vexing issue in cryptography. Even when analyzing protocols that are of practical importance, leading researchers often fail to treat this question with the seriousness that it deserves. We discuss nontightness in connection with complexity leveraging, HMAC, lattice-based cryptography, identity-based encryption, and hybrid encryption.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید