Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,237,304 papers from all fields of science
Search
Sign In
Create Free Account
Ident protocol
Known as:
Identd
, Identification protocol
, Port 113
Expand
The Ident Protocol (Identification Protocol, IDENT), specified in , is an Internet protocol that helps identify the user of a particular TCP…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Common Gateway Interface
Damien Doligez
Email authentication
Gibberish
Expand
Broader (1)
Internet Relay Chat
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Toward Open-Set Face Recognition
Manuel Günther
,
Steve Cruz
,
Ethan M. Rudd
,
T. Boult
IEEE Conference on Computer Vision and Pattern…
2017
Corpus ID: 10516079
Much research has been conducted on both face identification and face verification, with greater focus on the latter. Research on…
Expand
Highly Cited
2013
Highly Cited
2013
Network-Centric Quantum Communications with Application to Critical Infrastructure Protection
Richard J. Hughes
,
J. Nordholt
,
K. McCabe
,
Raymond T. Newell
,
C. G. Peterson
,
R. Somma
arXiv.org
2013
Corpus ID: 2266150
Network-centric quantum communications (NQC) - a new, scalable instantiation of quantum cryptography providing key management…
Expand
2011
2011
Full Cryptanalysis of the Chen Identification Protocol
P. Gaborit
,
Julien Schrek
,
G. Zémor
Post-Quantum Cryptography
2011
Corpus ID: 37320998
In 1995, K. Chen proposed a 5-pass zero-knowledge identification protocol based on the rank distance. The protocol is a 5-pass…
Expand
Highly Cited
2010
Highly Cited
2010
An Efficient Anti-Collision Protocol for RFID Tag Identification
Xiaolin Jia
,
Q. Feng
,
Chengzhen Ma
IEEE Communications Letters
2010
Corpus ID: 33405534
In this paper, an efficient anti-collision protocol, named collision tree protocol (CT), is proposed, and a collision tree is put…
Expand
Highly Cited
2009
Highly Cited
2009
Proofs of Storage from Homomorphic Identification Protocols
G. Ateniese
,
S. Kamara
,
Jonathan Katz
International Conference on the Theory and…
2009
Corpus ID: 18423822
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous…
Expand
Highly Cited
2008
Highly Cited
2008
A distributed fault identification protocol for wireless and mobile ad hoc networks
M. Elhadef
,
A. Boukerche
,
Hisham Elkadiki
J. Parallel Distributed Comput.
2008
Corpus ID: 42351142
Highly Cited
2000
Highly Cited
2000
Collaborative requirements negotiation with EasyWinWin
P. Grünbacher
Proceedings 11th International Workshop on…
2000
Corpus ID: 1200469
The EasyWinWin methodology supports collaborative elaboration, prioritization, and negotiation of system requirements. The…
Expand
Highly Cited
1995
Highly Cited
1995
Fabrication of two‐dimensional arrays of nanometer‐size clusters with the atomic force microscope
D. Schaefer
,
R. Reifenberger
,
A. Patil
,
R. P. Andres
1995
Corpus ID: 32874525
An atomic force microscope tip is used as a vector positioner to manipulate nanometer‐size preformed Au clusters deposited on…
Expand
1993
1993
PSather: Layered Extensions to an Object-Oriented Language for Efficient Parallel Computation
S. Murer
,
J. Feldman
,
C. Lim
,
M. Seidel
1993
Corpus ID: 59664859
class $DIST{T} is -supertype of all distributed data structures to be used -with the dist-statement nr_of_chunks: INT…
Expand
1991
1991
Bottleneck Identification Using Process Chronologies
E. Biefeld
,
L. Cooper
International Joint Conference on Artificial…
1991
Corpus ID: 6807478
We present a heuristics-based approach to deep space mission scheduling which is modeled on the approach used by expert human…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required