Search references for SIGNATURES WITH-EFFICIENT-PROTOCOLS. Phrases containing SIGNATURES WITH-EFFICIENT-PROTOCOLS
See searches and references containing SIGNATURES WITH-EFFICIENT-PROTOCOLS!SIGNATURES WITH-EFFICIENT-PROTOCOLS
Signatures with efficient protocols are a form of digital signature invented by Jan Camenisch and Anna Lysyanskaya in 2001. In addition to being secure
Signatures with efficient protocols
Signatures_with_efficient_protocols
Mathematical scheme for verifying the authenticity of digital documents
may be used with Bitcoin. Signatures with efficient protocols – are signature schemes that facilitate efficient cryptographic protocols such as zero-knowledge
Digital_signature
American cryptographer
Levchin Prize in 2024 “for the development of efficient Anonymous Credentials”. Signatures with efficient protocols Ukrainian: Анна А. Лисянська, romanized: Anna
Anna_Lysyanskaya
Digital signature scheme
It is efficient and generates short signatures. It was covered by U.S. patent 4,995,082 which expired in February 2010. All users of the signature scheme
Schnorr_signature
Cryptographic technique
security proofs for these protocols are based on the assumption that the random oracle is unique to the protocol: if two protocols share the same RO, the
Domain_separation
Method of exchanging cryptographic keys
itself is a non-authenticated key-agreement protocol, it provides the basis for a variety of authenticated protocols, and is used to provide forward secrecy
Diffie–Hellman_key_exchange
Digital signature scheme
than FDH signatures for a similar level of security. Signatures produced by the BLS signature scheme are often referred to as short signatures, BLS short
BLS_digital_signature
event. The protocol was invented during a key signing party with Len Sassaman, Werner Koch, Phil Zimmermann, and others. The Sassaman-efficient method is
Zimmermann–Sassaman key-signing protocol
Zimmermann–Sassaman_key-signing_protocol
Type of data structure
cryptographic hash of the labels of its child nodes. A hash tree allows efficient and secure verification of the contents of a large data structure. A hash
Merkle_tree
Subfield of cryptography
purpose protocols has moved to deal with efficiency improvements of the protocols with practical applications in mind. Increasingly efficient protocols for
Secure multi-party computation
Secure_multi-party_computation
Cryptography secured against quantum computers
digital signatures like RSA and DSA. Their primary drawback is that for any hash-based public key, there is a limit on the number of signatures that can
Post-quantum_cryptography
Concept in cryptography
hash-based cryptography is used to construct digital signatures schemes such as the Merkle signature scheme, zero knowledge and computationally integrity
Hash-based_cryptography
Non paper-based authority or certificate
privacy-enhancing protocols. Group signatures share similarities with Chaum's concept of credential systems. In a group signature scheme, members of
Digital_credential
Cryptographic system with public and private keys
identity-based) GOST R 34.10-2012 (Russia, elliptic curve signatures) EC-KCDSA (South Korea, elliptic curve signatures) DSTU 4145 (Ukraine, elliptic curve) Books on
Public-key_cryptography
Cryptographic network protocol
unsecured remote Unix shell protocols, such as the Berkeley Remote Shell (rsh) and the related rlogin and rexec protocols, which all use insecure, plaintext
Secure_Shell
Approach to public-key cryptography
pairing-based signatures, signcryption, key agreement, and proxy re-encryption. Elliptic curve cryptography is used successfully in numerous popular protocols, such
Elliptic-curve_cryptography
Placeholder characters
commonly used as placeholders in discussions about cryptographic systems and protocols, and in other science and engineering literature where there are several
Alice_and_Bob
Concept in computer science
useful by themselves, binary consensus protocols are often useful as building blocks in more general consensus protocols, especially for asynchronous consensus
Consensus_(computer_science)
Cryptographic algorithm for digital signatures
different signatures. Otherwise, the equation in step 6 can be solved for d A {\displaystyle d_{A}} , the private key: given two signatures ( r , s )
Elliptic Curve Digital Signature Algorithm
Elliptic_Curve_Digital_Signature_Algorithm
Type of digital signature in cryptography
the set's members' keys was used to produce the signature. Ring signatures are similar to group signatures but differ in two key ways: first, there is no
Ring_signature
Class of interactive proof
Science, nr 435 [1] On Sigma protocols Cramer, Ronald (1996). Modular Design of Secure yet Practical Cryptographic Protocols (Ph.D. thesis). CWI and University
Proof_of_knowledge
Interactive key creation in cryptography
process, two winner protocols were declared as "recommended by the CFRG for usage in IETF protocols": CPace and OPAQUE. Cryptographic protocol IEEE P1363 Simultaneous
Password-authenticated key agreement
Password-authenticated_key_agreement
Fault in a computer system that presents different symptoms to different observers
failures can occur even with no faulty hardware. A second solution requires unforgeable message signatures. Digital signatures can provide Byzantine fault
Byzantine_fault
Digital verification standard
The Digital Signature Algorithm (DSA) is a public-key cryptosystem and Federal Information Processing Standard for digital signatures, based on the mathematical
Digital_Signature_Algorithm
American computer scientist
doctoral thesis was on designing protocols secure against man-in-the-middle attacks, most notably describing an efficient protocol for password-based authenticated
Jonathan Katz (computer scientist)
Jonathan_Katz_(computer_scientist)
Cryptographic signature scheme
trees + Lamport signatures, as an efficient one-time signature scheme. An introduction to hash-based signatures and Merkle signatures by Adam Langley
Lamport_signature
Function computed by two parties that emulates a random oracle
distributed cryptographic protocols. Finding efficient post-quantum–secure implementations of OPRFs is an area of active research. "With the exception of OPRFs
Oblivious pseudorandom function
Oblivious_pseudorandom_function
Algorithm for public-key cryptography
TR-212. Bernstein, Daniel J. (January 31, 2008). RSA signatures and Rabin–Williams signatures: the state of the art (Report). (additional information
RSA_cryptosystem
Digital signature scheme
signature scheme is a digital signature scheme based on Merkle trees (also called hash trees) and one-time signatures such as the Lamport signature scheme
Merkle_signature_scheme
Proving validity without revealing other data
proof protocols. The property of witness-indistinguishability is related to that of zero-knowledge, yet witness-indistinguishable protocols do not suffer
Zero-knowledge_proof
Non-federated cryptographic protocol
key agreement protocols including the original triple elliptic-curve Diffie–Hellman (3-DH) handshake and the post-quantum PQXDH protocol. Current Signal
Signal_Protocol
Part of the third generation of firewall technology
and protocols. But blocking a web application that uses port 80 by closing the port would also mean complications with the entire HTTP protocol. Protection
Next-generation_firewall
Wireless network routing algorithm
connected, compared to many other protocols. Many of the simpler mesh routing protocols just flood the whole network with routing information whenever a
Hazy Sighted Link State Routing Protocol
Hazy_Sighted_Link_State_Routing_Protocol
Global system of connected computer networks
framework known as the Internet protocol suite (also called TCP/IP, based on the first two components.) This is a suite of protocols that are ordered into a set
Internet
Form of message tampering
the message over a secure channel. Such protocols, often using key-agreement protocols, have been developed with different security requirements for the
Man-in-the-middle_attack
Key agreement protocol
{\displaystyle x_{k}} (the x coordinate of the point). Most standardized protocols based on ECDH derive a symmetric key from x k {\displaystyle x_{k}} using
Elliptic-curve_Diffie–Hellman
Post-quantum cryptographic algorithm
David (2016-11-03). "NEON-SIDH: Efficient Implementation of Supersingular Isogeny Diffie-Hellman Key Exchange Protocol on ARM". Cryptology ePrint Archive
Supersingular isogeny key exchange
Supersingular_isogeny_key_exchange
Cryptographic primitives that involve lattices
computational lattice problems cannot be solved efficiently. In 2024 NIST announced the Module-Lattice-Based Digital Signature Standard for post-quantum cryptography
Lattice-based_cryptography
Computational hardness assumption
also use DLIN in a scheme for group signatures. The signatures are called "short group signatures" because, with a standard security level, they can be
Decision_Linear_assumption
Communication protocol for cryptographic keys
encodings of the protocol for environments where binary is not appropriate. All of these protocols are expected to be transmitted using TLS protocol in order
Key Management Interoperability Protocol
Key_Management_Interoperability_Protocol
Principal protocol used to stream data across an IP network
The Transmission Control Protocol (TCP) is one of the main protocols of the Internet protocol suite, providing reliable, ordered, and error-checked delivery
Transmission_Control_Protocol
Project by NIST to standardize post-quantum cryptography
"Round 1 (Additional Signatures) OFFICIAL COMMENT: Xifrat1-Sign.I". Tibouchi, Mehdi (18 July 2023). "Round 1 (Additional Signatures) OFFICIAL COMMENT: EagleSign"
NIST Post-Quantum Cryptography Standardization
NIST_Post-Quantum_Cryptography_Standardization
Elliptic curve used in Internet cryptography
Pohlig–Hellman algorithm attack. The protocol uses compressed elliptic point (only X coordinates), so it allows efficient use of the Montgomery ladder for
Curve25519
implicit certificate scheme. It is described in the document Standards for Efficient Cryptography 4 (SEC4). This article will use ECQV as a concrete example
Implicit_certificate
Secure network protocol suite
two computers over an Internet Protocol network. It is used in virtual private networks (VPNs). IPsec includes protocols for establishing mutual authentication
IPsec
Entity that issues digital certificates
of the certificate. This allows others (relying parties) to rely upon signatures or on assertions made about the private key that corresponds to the certified
Certificate_authority
1997 international treaty to reduce greenhouse gas emissions
would prevent dangerous anthropogenic interference with the climate system" (Article 2). The Kyoto Protocol applied to the seven greenhouse gases listed in
Kyoto_Protocol
Future Internet architecture
architecture that aims to offer high availability and efficient point-to-point packet delivery with network path selection, even in the presence of actively
SCION_(Internet_architecture)
Network protection device or software
available. In signature-based IDS, the signatures are released by a vendor for all its products. On-time updating of the IDS with the signature is a key aspect
Intrusion_detection_system
Award
or more individuals for theoretical advancements to cryptographic methods with a practical impact, while the other has recognized one or more individuals
Levchin_Prize
in order to match network traffic to known-malicious signatures. Attacks on encrypted protocols such as HTTPS cannot be read by an IDS unless the IDS
Intrusion detection system evasion techniques
Intrusion_detection_system_evasion_techniques
Public-key exchange protocol
A High-Performance Secure Diffie–Hellman Protocol by Hugo Krawczyk Another look at HMQV An Efficient Protocol for Authenticated Key Agreement MQV and HMQV
MQV
Multipurpose Internet Mail Extensions
messages with MIME formatting are typically transmitted with standard protocols, such as the Simple Mail Transfer Protocol (SMTP), the Post Office Protocol (POP)
MIME
McCullagh, Noel; Quisquater, Jean-Jacques (2005). "Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps". In Roy, Bimal
SM9_(cryptography_standard)
Internet protocol
hand, can process packets efficiently and with minimum overhead—which is important for performance reasons. The IKE protocol uses UDP packets, usually
Internet_Key_Exchange
Method for dividing a secret among multiple parties
more efficient to encrypt the secret and then distribute the key using secret sharing. Secret sharing is an important primitive in several protocols for
Secret_sharing
File synchronization protocol and software
at the same start address as the chunk at the recipient. This allows efficient transmission of files which differ by insertions and deletions. When rsync
Rsync
NTRU public-key cryptography digital signature algorithm
perturbed signatures enabled any useful attack. In 2012 an attack on the scheme with perturbations was presented that required a few thousand signatures for
NTRUSign
System that regulates the formation of blocks on a blockchain
FPGAs to ASICs. There are two classes of proof-of-work protocols. Challenge–response protocols assume a direct interactive link between the requester
Proof_of_work
Cryptographic attack
input to the hash function. Because digital signature algorithms cannot sign a large amount of data efficiently, most implementations use a hash function
Collision_attack
Quantum-safe key encapsulation mechanism
For a chat encryption scenario using liboqs, replacing the extremely efficient, non-quantum-safe ECDH key exchange using Curve25519 was found to increase
ML-KEM
Digital signature resilient to quantum cryptography
learning with errors. Ring learning with errors based digital signatures are among the post quantum signatures with the smallest public key and signature sizes
Ring learning with errors signature
Ring_learning_with_errors_signature
Multimedia Internet KEYing (MIKEY) is a key management protocol that is intended for use with real-time applications. It can specifically be used to set
MIKEY
Annual award
cryptography and its efficient cryptographic hardware and software implementations, to developing and deploying new actual protocols (such as the Transport
RSA Award for Excellence in Mathematics
RSA_Award_for_Excellence_in_Mathematics
Computational hardness assumption used in elliptic curve cryptography
in some pairing-based cryptographic protocols. In certain elliptic curve subgroups, the existence of an efficiently-computable bilinear map (pairing) can
XDH_assumption
Hash function that is suitable for use in cryptography
storage and digital signatures. Even a small change in the input results in a very different hash, meaning that it functions as an efficient and consistent
Cryptographic_hash_function
Unsolved problem in cryptography
cryptosystems—both for public-key encryption and digital signatures. More specifically, the RSA problem is to efficiently compute P given an RSA public key (N, e) and
RSA_problem
Computer network protocol
publish-subscribe communication patterns Communication protocol independent. Mappings to several communication protocols like TCP/IP, UDP/IP, WebSockets, AMQP and
OPC_Unified_Architecture
Technical standard
applications. There are also two schemes for dealing with signatures: RSASSA-PKCS1-v1_5: old Signature Scheme with Appendix (SSA) as first standardized in version
PKCS_1
Field of asymmetric cryptographic primitives
and Yen-Hung Chen, TTS: High-Speed Signatures on a Low-Cost Smart Card, 2004 Nicolas T. Courtois, Short Signatures, Provable Security, Generic Attacks
Multivariate_cryptography
International agreement defining the rights and duties of municipalities and regions
it – to respect a number of principles. Chart of signatures and ratifications. Additional Protocol to the European Charter of Local Self-Government on
European Charter of Local Self-Government
European_Charter_of_Local_Self-Government
Asymmetric encryption algorithm developed by Robert McEliece
it was thought that McEliece could not be used to produce signatures. However, a signature scheme can be constructed based on the Niederreiter scheme
McEliece_cryptosystem
Post-quantum signature scheme
Gerard, and Mehdi Tibouchi. [Side-Channel Attacks on BLISS Lattice-Based Signatures -- Exploiting Branch Tracing Against strongSwan and Electromagnetic Emanations
BLISS_signature_scheme
Evans. Retrieved 2009-09-12. "Efficient Extensible Interchange". Ion Binary Encoding "MessagePack is an extremely efficient object serialization library
Comparison of data-serialization formats
Comparison_of_data-serialization_formats
Decomposition of a number into a product
factorization on any classical computer increases drastically. Many cryptographic protocols are based on the presumed difficulty of factoring large composite integers
Integer_factorization
System to identify resources on a network
locating and identifying computer services and devices with the underlying network protocols. The Domain Name System has been an essential component
Domain_Name_System
DNSSEC Servers with this feature implement some variant of the DNSSEC protocols. They may publish names with resource record signatures (providing a "secure
Comparison of DNS server software
Comparison_of_DNS_server_software
Branch of automation
historically relied on robust proven protocols (like BACnet) while proprietary protocols (like X-10) were used in homes. With the advent of wireless sensor networks
Building_automation
Cryptography based on quantum mechanical phenomena
allows the protocol to circumvent the impossibility result, commitment and oblivious transfer protocols can now be implemented. The protocols in the BQSM
Quantum_cryptography
Class of functions in cryptography
along with the permutation output. There is also a theorem that has been proven in this regard which states that if there exists an efficient UP adversary
Pseudorandom_permutation
Data structure for approximate set membership
Memory-Efficient Probabilistic Verification", Proceedings of Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol
Bloom_filter
Protocols and procedures to combat caller ID spoofing
use the protocols since June 30, 2021. The Canadian Radio-television and Telecommunications Commission (CRTC) requires use of the protocols by November
STIR/SHAKEN
EPOC (Efficient Probabilistic Public Key Encryption) is a probabilistic public-key encryption scheme. EPOC was developed in 1999 by T. Okamoto, S. Uchiyama
Efficient Probabilistic Public-Key Encryption Scheme
Efficient_Probabilistic_Public-Key_Encryption_Scheme
Network protocol that builds a loop-free logical topology for Ethernet networks
several AM-Records, allowing full backwards compatibility with RSTP and STP standard protocols. Each of the AM-Records contains the data used to negotiate
Multiple Spanning Tree Protocol
Multiple_Spanning_Tree_Protocol
Computer science concept
interactions with server replicas. The approach also provides a framework for understanding and designing replication management protocols. In terms of
State_machine_replication
Cryptographic primitive
non-interactive zero-knowledge protocols do not preserve all of the properties of interactive zero-knowledge protocols; e.g., they do not preserve deniability
Non-interactive zero-knowledge proof
Non-interactive_zero-knowledge_proof
and authentication. These protocols are very similar to the corresponding protocols in the commutative case. In these protocols it would be assumed that
Non-commutative_cryptography
Tracking system using transceivers on ships
not have these secret codes or information. Authentication protocols include digital signatures of the sender that direct receivers to decryption keys distributed
Automatic identification system
Automatic_identification_system
Practice and study of secure communication techniques
behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages
Cryptography
Goppa code, G, capable of correcting t errors. This code possesses an efficient decoding algorithm. Alice generates a (n − k) × n parity check matrix
Niederreiter_cryptosystem
Data interface description language
number of protocols. Its most extensive uses continue to be telecommunications, cryptography, and biometrics. ASN.1 is closely associated with a set of
ASN.1
Network protocol
malicious provider. The protocol requires each participant to sign its user's operations with its own certificate. The signatures of all the operations
Google Wave Federation Protocol
Google_Wave_Federation_Protocol
Streaming data transfer mechanism in HTTP/1.1
fields would be sent in the message's header; however, it may be more efficient to determine them after processing the entire message entity. In that
Chunked_transfer_encoding
Error-detecting code for detecting data changes
given message size) than the polynomials of earlier protocols, and publishing the best of these with the aim of improving the error detection capacity of
Cyclic_redundancy_check
Privacy-focused cryptocurrency
ring signatures, which groups a sender's outputs with other decoy outputs.[citation needed] Encryption of transaction amounts began in 2017 with the implementation
Monero
American business executive (born 1973)
University. Mohan grew up in Ann Arbor, Michigan. He moved to India in 1985, with his family, spending the next seven years completing high school at St. Francis'
Neal_Mohan
Revision control software
networking protocols for synchronizing trees, it now exclusively uses a custom protocol called netsync, which is more robust and efficient, and shares
Monotone_(software)
Collection of efficiently-computable functions which emulate a random oracle
collection of efficiently-computable functions which emulate a random oracle in the following way: no efficient algorithm can distinguish (with significant
Pseudorandom_function_family
Public-key cryptosystem
exchange computations with message computations. The first party, Alice, generates a key pair as follows: Generate an efficient description of a cyclic
ElGamal_encryption
Device used to gain access to restricted resource
information such as passwords, cryptographic keys used to generate digital signatures, or biometric data (such as fingerprints). Some designs incorporate tamper
Security_token
travel, tourism, insurance
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
SIGNATURES WITH-EFFICIENT-PROTOCOLS
travel, tourism, insurance