Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Encrypting problem instances: Or ... can you take advantage of someone without having to trust him?
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Introduction to algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Handbook of Applied Cryptography
Handbook of Applied Cryptography
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Transitive Signatures Based on Factoring and RSA
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Content extraction signatures using XML digital signatures and custom transforms on-demand
WWW '03 Proceedings of the 12th international conference on World Wide Web
Proxy re-signatures: new definitions, algorithms, and applications
Proceedings of the 12th ACM conference on Computer and communications security
Note: A simple transitive signature scheme for directed trees
Theoretical Computer Science
One-Way Signature Chaining: a new paradigm for group cryptosystems
International Journal of Information and Computer Security
Short Redactable Signatures Using Random Trees
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Reasoning about XML update constraints
Journal of Computer and System Sciences
Grouping verifiable content for selective disclosure
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Context adapted certificate using morph template signature for pervasive environments
UCS'07 Proceedings of the 4th international conference on Ubiquitous computing systems
Transitive signatures from braid groups
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Separation results on the "one-more" computational problems
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Bounded vector signatures and their applications
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Hierarchical identity-based chameleon hash and its applications
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A new method for the design of stateless transitive signature schemes
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
A provably secure short transitive signature scheme from bilinear group pairs
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Computing of trust in ad-hoc networks
CMS'06 Proceedings of the 10th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Extended sanitizable signatures
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Directed transitive signature scheme
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Homomorphic signatures for digital photographs
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Short transitive signatures for directed trees
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Computing on authenticated data
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Redactable Signatures for Signed CDA Documents
Journal of Medical Systems
X316 security toolbox for new generation of certificate
TrustBus'07 Proceedings of the 4th international conference on Trust, Privacy and Security in Digital Business
Computing on authenticated data: new privacy definitions and constructions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Computing on authenticated data for adjustable predicates
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
We introduce and provide the first example of a transitive digital signature scheme. Informally, this is a way to digitally sign vertices and edges of a dynamically growing, transitively closed, graph G so as to guarantee the following properties: - Given the signatures of edges (u, v) and (v, w), anyone can easily derive the digital signature of the edge (u, w). - It is computationaly hard for any adversary to forge the digital signature of any new vertex or other edge of G, even if he can request the legitimate signer to digitally sign any number of G's vertices and edges of his choice in an adaptive fashion (i.e., even if he can choose which vertices and edges the legitimate signer should sign next after he sees the legitimate signatures of the ones requested so far).